Subband decomposition: an LMS-based algorithm to approximate the perfect reconstruction bank in the general case

Author

Paillard, B. ; Soumagne, J. ; Mabilleau, P. ; Morissette, S.

Author_Institution

Dept. of Electr. Eng., Sherbrooke Univ., Que., Canada

Volume

39

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

233

Lastpage

238

Abstract

An algorithm based on least mean squares (LMS) is described. Given an arbitrary invertible decomposition/decimation process, the algorithm will find the finite impulse response reconstruction filters which best approximate the perfect reconstruction ones. By allowing the reconstruction filters´ impulse responses to be sufficiently long, the quality of the approximation can be made as good as required. Two examples are presented for the implementation of this algorithm: one in the case of a decomposition by a filter bank of Galand (1977), where the reconstruction bank is already known, the other in the situation of a two-subband decomposition where one of the subbands covers two-thirds of the frequency space, and the other covers the remaining one-third

Keywords

digital filters; filtering and prediction theory; least squares approximations; FIR filters; LMS-based algorithm; approximation; arbitrary invertible decomposition/decimation process; finite impulse response reconstruction filters; least mean squares; perfect reconstruction bank; subband decomposition; Channel bank filters; Delay; Filter bank; Finite impulse response filter; Frequency; IIR filters; Iterative algorithms; Least squares approximation; Stochastic processes; Sufficient conditions;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.80794

Filename

80794