By Topic

M-channel lifting factorization of perfect reconstruction filter banks and reversible M-band wavelet transforms

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
$33 $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

2 Author(s)
Chen, Ying-Jui ; Wavelet Group in the Intelligent Eng. Syst. Lab, Massachusetts Inst. of Technol., Cambridge, MA, USA ; Amaratunga, K.S.

An intrinsic M-channel lifting factorization of perfect reconstruction filter banks (PRFBs) is presented as an extension of Sweldens' conventional two-channel lifting scheme. Given a polyphase matrix E(z) of a finite-impulse response (FIR) M- channel PRFB with det(E(z))=z-K, K∈Z, a systematic M-channel lifting factorization is derived based on the Monic Euclidean algorithm. The M-channel lifting structure provides an efficient factorization and implementation; examples include optimizing the factorization for the number of lifting steps, delay elements, and dyadic coefficients. Specialization to paraunitary building blocks enables the design of paraunitary filter banks based on lifting. We show how to achieve reversible, possibly multiplierless, implementations under finite precision, through the unit diagonal scaling property of the Monic Euclidean algorithm. Furthermore, filter-bank regularity of a desired order can be imposed on the lifting structure, and PRFBs with a prescribed admissible scaling filter are conveniently parameterized.

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:50 ,  Issue: 12 )