A second-order cone programming approach for minimax design of 2-D FIR filters with low group delay
Wu-Sheng Lu, Takao Hinamoto
Abstract
Wu-Sheng Lu, Takao Hinamoto
Abstract
A design algorithm based on second-order cone programming (SOCP) for minimax design of 2-D FIR filters with low group delay is proposed. SOCP is a special class of convex programming problems that can be carried out considerably more efficiently than the popular semidefinite programming. The simulation studies presented in this paper also confirm this in a filter design context. The proposed algorithm is compared favorably with a recently proposed design method based on sequential quadratic programming. The proposed design method is expected to be a useful utility for 2-D digital filter designers whose interest is not limited to linear phase responses and low order filters.
OpenAlex reports 25 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A design algorithm based on second-order cone programming (SOCP) for minimax design of 2-D FIR filters with low group delay is proposed. SOCP is a special class of convex programming problems that can be carried out considerably more efficiently than the popular semidefinite programming. The simulation studies presented in this paper also confirm this in a filter design context. The proposed algorithm is compared favorably with a recently proposed design method based on sequential quadratic programming. The proposed design method is expected to be a useful utility for 2-D digital filter designers whose interest is not limited to linear phase responses and low order filters.
Key concepts: Second-order cone programming, Minimax, Finite impulse response, Semidefinite programming, Quadratic programming, Context (archaeology), Linear phase, Mathematical optimization