Iterative algorithms for envelope constrained recursive filter design via Laguerre functions

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

doi:10.1109/81.802824

Iterative algorithms for envelope constrained recursive filter design via Laguerre functions

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

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1342-1348
Number of pages	7
Journal	IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume	46
Issue number	11
DOIs	https://doi.org/10.1109/81.802824
Publication status	Published - 1 Nov 1999

Access to Document

10.1109/81.802824

Cite this

@article{e7a6d6775ddb4d53ab719ef85f83fce7,

title = "Iterative algorithms for envelope constrained recursive filter design via Laguerre functions",

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.",

author = "Zhuquan Zang and Vo, {Ba Ngu} and Antonio Cantoni and Teo, {Kok Lay}",

year = "1999",

month = nov,

day = "1",

doi = "10.1109/81.802824",

language = "English",

volume = "46",

pages = "1342--1348",

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

issn = "1057-7122",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

number = "11",

}

TY - JOUR

T1 - Iterative algorithms for envelope constrained recursive filter design via Laguerre functions

AU - Zang, Zhuquan

AU - Vo, Ba Ngu

AU - Cantoni, Antonio

AU - Teo, Kok Lay

PY - 1999/11/1

Y1 - 1999/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033225313&partnerID=8YFLogxK

U2 - 10.1109/81.802824

DO - 10.1109/81.802824

M3 - Article

AN - SCOPUS:0033225313

SN - 1057-7122

VL - 46

SP - 1342

EP - 1348

JO - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

IS - 11

ER -

Iterative algorithms for envelope constrained recursive filter design via Laguerre functions

Abstract

Access to Document

Other files and links

Fingerprint

Cite this