Constrained Chebyshev approximation for FIR filters

F. Grenez · 2005

Constrained Chebychev 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.

Read the paper · More papers on PaperTik