Abstract

A fast architecture for the implementation of FIR filters based on the residue number system is proposed. High-speed is obtained by introducing residue arithmetic that permits the computation of the filter output by using N FIR subfilters of reduced dynamic range operating in parallel. Moreover, a new approach for the computation of the modulo operation on each term of the linear combination has been developed. The filter implementation is based on small look-up tables and fast multioperand carry-save adders.

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

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.