Iterative algorithms for envelope constrained recursive filter design via Laguerre functions

Author

Zang, Zhuquan ; Vo, Ba-Ngu ; Cantoni, Antonio ; Teo, Kok Lay

Author_Institution

Telecommun. Res. Inst., Curtin Univ. of Technol., Perth, WA, Australia

Volume

46

Issue

11

fYear

1999

fDate

11/1/1999 12:00:00 AM

Firstpage

1342

Lastpage

1348

Abstract

The envelope constrained (EC) filtering problem is concerned with the design of a time-invariant filter to process a given input pulse such that the output waveform is guaranteed to lie within a prescribed output mask. Using the orthonormal Laguerre functions the EC filtering problem can be posed as a quadratic programming (QP) problem with affine inequality constraints. An iterative algorithm for solving this QP problem is proposed. We also show that for the EC filtering problem, filters based on Laguerre functions offer a more robust and low-order alternative to finite impulse response (FIR) filters. A numerical example, concerned with the design of an equalization filter for a digital transmission channel, is presented to illustrate the effectiveness of the iterative algorithm and the Laguerre filter

Keywords

iterative methods; quadratic programming; recursive filters; affine inequality constraints; digital transmission channel; envelope constrained recursive filter; equalization filter; filter design; iterative algorithms; orthonormal Laguerre functions; output waveform; quadratic programming; time-invariant filter; Algorithm design and analysis; Digital filters; Filtering; Finite impulse response filter; IIR filters; Iterative algorithms; Noise shaping; Pulse shaping methods; Quadratic programming; Shape;

fLanguage

English

Journal_Title

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on

Publisher

ieee

ISSN

1057-7122

Type

jour

DOI

10.1109/81.802824

Filename

802824