Optimal design of finite precision FIR filters using linear programming with reduced constraints

Author

Cho, Nam Ik ; Lee, Sang Uk

Author_Institution

Sch. of Electr. Eng., Seoul Univ., South Korea

Volume

46

Issue

1

fYear

1998

fDate

1/1/1998 12:00:00 AM

Firstpage

195

Lastpage

199

Abstract

An algorithm for the design of optimal one-dimensional (1-D) and two-dimensional (2-D) FIR filters over a discrete coefficient space is proposed. The algorithm is based on the observation that the equiripple frequencies of a subproblem (SP) in the branch and bound (BaB) algorithm are closely related to those of neighboring SPs. By using the relationship among the SPs, the proposed algorithm reduces the number of constraints required for solving each SP. Thus, the overall computational load for the design of FIR filters with discrete coefficients is significantly alleviated, compared with the conventional BaB algorithm

Keywords

FIR filters; linear programming; two-dimensional digital filters; algorithm; branch and bound algorithm; computational load; discrete coefficients; equiripple frequencies; finite precision FIR filters; linear programming; one-dimensional FIR filters; optimal design; reduced constraints; subproblem; two-dimensional FIR filters; Algorithm design and analysis; Digital filters; Finite impulse response filter; Frequency; Linear programming; Minimax techniques; Nonlinear filters; Sampling methods; Signal processing algorithms; Two dimensional displays;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.651214

Filename

651214