This brief presents a novel fast algorithm derivation and structure design of analysis and synthesis quadrature mirror filterbanks (SQMFs) on the spectral band replication in Digital Radio Mondiale (DRM). After the preprocedure and postprocedure, a Fourier-transform-based computational kernel was required to construct two types of fast algorithms that offered certain advantages. The Proposed-I method employs a modified split-radix fast Fourier transform (FFT) for analysis quadrature mirror filterbank (AQMF) to reduce the number of additions at the last stage of the butterfly and adopts a split-radix FFT to calculate the SQMF coefficients. The Proposed-II method used the compact structure of the variable-length recursive DFT to realize the kernel procedure for the proposed fast AQMF and SQMF algorithms. In addition, a well-known lifting scheme was applied to reduce numerous multiplication and addition calculations. Compared with the original calculations for the long transform length, all multiplication, addition, and coefficient operations for the Proposed-I method (i.e., AQMF + SQMF) had 91.65%, 79.81%, and 97.22% reductions, respectively. However, for the Proposed-II method, the total reductions of multiplication, addition, and coefficient operations were 64.16%, 21.53%, and 97.12%, respectively. Compared with the fast SQMF algorithm by Huang et al., the Proposed-I method for SQMF reduces 58.33% of the multiplication, 65% of the addition, and 67.19% of the coefficients. Therefore, the proposed fast quadrature mirror filterbank algorithm is a better solution than other approaches for future DRM applications.
|Number of pages||5|
|Journal||IEEE Transactions on Circuits and Systems II: Express Briefs|
|Publication status||Published - 2013 Sep 23|
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering