Abstract
Minimax design of 1-dimensional recursive digital filters is currently achieved by using iterative methods based on linear or nonlinear programming. The methods need extensive computation and their convergence cannot be always guaranteed. Recently Charalambous developed a closed form approach for designing minimax elliptic filters. In the present paper, the Charalambous approach is extended into developing a closed form approach for designing 1-dimensional recursive minimax digital filters of any given approximation type satisfying prescribed specifications. The amount of computation needed by the new approach is insignificant. A general-purpose computer program has also been developed that embodies the classical and minimax Butterworth, Chebychev and elliptic approximations.
Sign-in/Register to access full text options 
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 callMore From: IEE Proceedings G (Electronic Circuits and Systems)
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.
