Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Paillard, B. ; Dept. of Electr. Eng., Sherbrooke Univ., Que., Canada ; Soumagne, J. ; Mabilleau, P. ; Morissette, S.

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

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 1 )