Abstract
Frequency sampling filters (FSFs) are of interest to designers of filter banks due, in part, to their intrinsic low complexity and linear phase behavior. FSF designs rely on exact pole-zero annihilation and are often found in embedded applications. Exact FSF pole-zero annihilation can be guaranteed by using polynomial filters defined over an integer ring in the residue number system (RNS) along with algebraic integers. An FPGA implementation example is presented which offers an 86% complexity reduction compared with standard nonrecursive FIR designs.
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.
