Abstract
This paper investigates the use of polynomial transforms for the implementation of uniform digital bandpass filter banks. The technique is based upon a decomposition of the N bandpass filters into a set of real polyphase filters followed by a DCT (discrete cosine transform) of size N. The DCT is converted into a DFT (discrete Fourier transform) of size N and the polyphase filters are evaluated by DFT's. This procedure yields a two-dimensional DFT which is computed by a polynomial transform and odd DFT's. We show that this technique reduces significantly the number of arithmetic operations when compared to conventional methods, and yields a regular structure in which most of the computations are performed with FFT-type algorithms.
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
