Abstract

A synthesis procedure for low-order FIR filters based on the cascading of computationally simple (and in some cases very computationally efficient) primitive sections is described. An integer programming approach effectively yields an optimal factorisation of a low-order transfer function H(z) that satisfies the filter specification and, hence, yields also an optimal cascade of available primitives. If the primitive cascade approach is used, synthesised filters are considerably more computationallly efficient than optimal direct form realisations. The design process is noniterative, completely automatic and particularly suitable for high sample rate applications.

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.