Design of powers-of-two coefficient FIR filters with minimum arithmetic complexity

Author

Park, In-Soon ; Oh, Woo Jan ; Lee, Yong Hoon

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea

Volume

1

fYear

2002

fDate

2002

Firstpage

517

Abstract

A mixed-integer-linear-programming (MILP)-based algorithm is proposed for designing canonic-signed-digit (CSD) FIR filters with minimal complexity. The proposed algorithm reduces the number of variables in MILP through certain modifications of the scheme proposed by Chia-Yu Yao (Proc. IEEE Int. Symp. Circ. Sys., vol. 2, pp. 301-304, 2001). Design examples demonstrate that the proposed algorithm can design a CSD FIR filter with minimum complexity and requires less computation than the existing MILP algorithm.

Keywords

FIR filters; computational complexity; integer programming; linear phase filters; linear programming; minimisation; CSD FIR filter; MILP variables; MILP-based algorithm; canonic-signed-digit FIR filters; linear phase FIR filter; minimum arithmetic complexity design; mixed-integer-linear-programming-based algorithm; powers-of-two coefficient FIR filters; Algorithm design and analysis; Constraint optimization; Design engineering; Digital arithmetic; Finite impulse response filter; Frequency response; Passband; Power engineering and energy;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2002. APCCAS '02. 2002 Asia-Pacific Conference on

Print_ISBN

0-7803-7690-0

Type

conf

DOI

10.1109/APCCAS.2002.1115052

Filename

1115052