Sparse FIR Filter Design Using Binary Particle Swarm Optimization

Chen WU  Yifeng ZHANG  Yuhui SHI  Li ZHAO  Minghai XIN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A   No.12   pp.2653-2657
Publication Date: 2014/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.2653
Type of Manuscript: LETTER
Category: Digital Signal Processing
binary particle swarm optimization (BPSO),  sparse FIR filter,  

Full Text: PDF(210.5KB)>>
Buy this Article

Recently, design of sparse finite impulse response (FIR) digital filters has attracted much attention due to its ability to reduce the implementation cost. However, finding a filter with the fewest number of nonzero coefficients subject to prescribed frequency domain constraints is a rather difficult problem because of its non-convexity. In this paper, an algorithm based on binary particle swarm optimization (BPSO) is proposed, which successively thins the filter coefficients until no sparser solution can be obtained. The proposed algorithm is evaluated on a set of examples, and better results can be achieved than other existing algorithms.