A comparison of algorithms for minimax design of two-dimensional linear phase FIR digital filters

Linear programming algorithms for the design of finite impulse response (FIR), linear-phase digital filters can be extremely time-consuming. Two iterative design techniques using multiple-exchange ascent algorithms have been developed. These are the methods of Kamp and Thiran and Hersey and Mersereau. They are known to be much faster than the linear programming techniques. The mathematical basis for these algorithms is reviewed and differences in the algorithms are noted. Results of empirical efficiency comparisons are presented. A new algorithm for reducing the number of iterations for multiple-exchange ascent algorithms is also presented.