By Topic

A class of efficient recursive quadrature mirror filters for subband coding

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

2 Author(s)
Pei, Soo-Chang ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Sy-Been Jaw

A class of recursive quadrature mirror filters (QMFs) of the form H(Z)=N(Z)/D(Z 2) is proposed for subband coding. These filters can be efficiently designed with the iterative Remez exchange algorithm. Simple modifications are made to the Pei (see IEEE Trans. Circuits Syst., vol.CAS-36, no.2, p.311, 1989), Liang, McClellan, and Parks computer program for designing these recursive QMF filters efficiently. The resulting filters totally eliminate the aliasing terms and can achieve almost perfect magnitude reconstruction, with -131.5-dB distortion. A design example is presented to show the effectiveness of this approach

Published in:

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