Abstract
In this paper, a new fast implementation of nearly perfect reconstruction finite impulse response (FIR) cosine-modulated filterbanks is shown. A new expression for the analysis bank has been developed, and based on it, an efficient implementation structure is obtained for specific prototype filter lengths. The new computationally efficient algorithm can be applied to both the conventional cosine-modulated filterbank and the Koilpillai-Vaidyanathan pseudo-quadrature mirror filterbank. We also show how the implementation cost (measured in multiplications and additions per input sample) is reduced.
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 callDisclaimer: 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.
