Abstract
Constrained Chebyshev approximation is a known mathematical problem, and Remes' type algorithms for finding the solution have been described. It is shown in this paper that the classical Parks-McClellan program can be converted into a general program for constrained approximation. The program can serve for the design of both linear and minimum phase FIR digital filters.
Full Text
Published Version
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