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

• Published in: IEEE transactions on signal processing Vol. 39; no. 1; pp. 233 - 238
• Main Authors: Paillard, B., Soumagne, J., Mabilleau, P., Morissette, S.
• Format: Journal Article
• Language: English
• Published: IEEE 01.01.1991
• Subjects: Channel bank filters; Delay; Filter bank; Finite impulse response filter; Frequency; IIR filters; Iterative algorithms; Least squares approximation; Stochastic processes; Sufficient conditions
• ISSN: 1053-587X
• DOI: 10.1109/78.80794

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