Abstract

A new look-ahead (LA) scheme, distributed look-ahead (DLA), is proposed for pipelined implementation of recursive digital filters. It is established that, in the case of many recursive filters, DLA can provide equivalent and stable implementation with reduced multiplication and latch complexities, and higher area-efficiency. It also produces outputs with reduced delays, when compared with some existing LA schemes. Stability regions for the proposed scheme are also well defined. Next, a time-domain approximation method is proposed for direct design of pipelined recursive filters that can achieve superior match with reduced pipelined filter orders.

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.