In this paper, we propose a fast and low roundoff noise implementation of alias-free quadrature mirror filters (QMF‘s) for tree-structured subband coding. When N-tap FIR QMF's are directly utilized, they require 2N multiplications and 2(N - 1) additions to obtain a pair of high band and low band decimated outputs. Using recursive formulas and the polyphase concept, a QMF implementation is proposed that, for both analysis and synthesis stages, needs only (N/2 + 2) multiplications and (3N/2 + 8) additions to compute the same outputs. Furthermore, the proposed algorithm can reduce roundoff error when finite-wordlength processors are used to implement the encoder and decoder. Simulation examples for image coding are also given to demonstrate the differences between the proposed and previously-known algorithms.
|Number of pages||9|
|Journal||IEEE Transactions on Circuits and Systems for Video Technology|
|Publication status||Published - 1995 Dec|
All Science Journal Classification (ASJC) codes
- Media Technology
- Electrical and Electronic Engineering