Abstract
An improved implementation of the oddly stacked Princen-Bradley filter bank is proposed. The new implementation is based on the same approach as suggested by Duhamel et al. [1991], where the complex fast Fourier transform algorithm of length equal to half of the number of subbands is used in order to obtain a significant reduction of number of arithmetic operations. In the implementation, the analysis filter bank is similar to Duhamel's, with some minor differences. However, the synthesis filter bank is quite different, having easy and elegant merging of output rotations and windows and reduced arithmetic complexity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
