Abstract

The problem of designing recursive digital filters with optimized word length coefficients to meet arbitrary, prescribed magnitude characteristics in the frequency domain is numerically investigated. The continuous nonlinear programming problem is formulated as an unconstrained minimax problem using the Bandler-Charalambous approach, and Dakin's branch-and-bound technique is used in conjunction with Fletcher's unconstrained minimization program to discretize the continuous solution. The objective function to be minimized is directly concerned with the word lengths of the coefficients, which are also introduced as variables.††This paper was presented at the Eighth Annual Princeton Conference on Information Sciences and Systems, Princeton, N.J., March 28–29, 1974.

Full Text
Paper version not known

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.