The envelope constrained (EC) filtering problem is concerned with the design of a filter with minimum gain to white input noise and with a response to a given signal that fits into a prescribed envelope. Using the discrete-time orthonormal Laguerre network, the EC filtering problem is posed as a quadratic programming (QP) problem with affine inequality constraints. An iterative algorithm for solving this QP problem is proposed which serves as a basis for the derivation of adaptive algorithms for applications where the parameters of the underlying signal model are either not known or varying with time.
|Number of pages||4|
|Journal||ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings|
|Publication status||Published - 1 Jan 1996|
|Event||1996 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1996 - Atlanta, GA, USA|
Duration: 7 May 1996 → 10 May 1996