论文信息 - Minimax optimization of recursive digital filters using recent minimax results

Minimax optimization of recursive digital filters using recent minimax results

The purpose of this paper is to use some recent work by the author on nonlinear minimax optimization to derive an efficient algorithm for the minimax optimization problem. This is followed by the application of the algorithm to the problem of choosing the coefficients of a recursive digital filter to meet arbitrary design specifications on the magnitude or the group delay characteristics.

C. Charalambous

[1] C. Charalambous,et al. Nonlinear programming using minimax techniques , 1974 .

[2] L. Rabiner,et al. Linear programming design of IIR digital filters with arbitrary magnitude function , 1974 .

[3] C. Charalambous,et al. Minimax design of recursive digital filters , 1974 .

[4] J. Bandler,et al. Least pth optimization of recursive digital filters , 1973 .

[5] John W. Bandler,et al. New Algorithms for Network Optimization , 1973 .

[6] John W. Bandler,et al. Practical Least pth Optimization of Networks , 1972 .

[7] A. Deczky. Synthesis of recursive digital filters using the minimum p-error criterion , 1972 .

[8] John W. Bandler,et al. Conditions for a minimax optimum , 1971 .

[9] H. Helms. Digital filters with equiripple or minimax responses , 1971 .

[10] K. Steiglitz. Computer-aided design of recursive digital filters , 1970 .

[11] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..