This paper introduces a general class of M-channel linear phase perfect reconstruction filter banks (FBs) with rational coefficients. A subset of the presented solutions has dyadic coefficients, leading to multiplierless implementations suitable for low-power mobile computing. All of these FBs are constructed from a lattice structure that is VLSI-friendly, employs the minimum number of delay elements, and robustly enforces both linear phase and perfect reconstruction property. The lattice coefficients are parameterized as a series of zero-order lifting steps, providing fast, efficient, in-place computation of the subband coefficients. Despite the tight rational or integer constraint, image coding experiments show that these novel FBs are very competitive with current popular transforms such as the 8×8 discrete cosine transform and the wavelet transform with 9/7-tap biorthogonal irrational-coefficient filters
Published in:
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
(Volume:49
,
Issue:
7
)
Date of Publication: Jul 2002