Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1587/transfun.E97.A.2653 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
binary particle swarm optimization (BPSO), sparse FIR filter | Mathematical optimization,Binary particle swarm optimization,Multi-swarm optimization,Fir filter design,Mathematics | Journal |
Volume | Issue | ISSN |
E97A | 12 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wu Chen | 1 | 59 | 19.58 |
| Yifeng Zhang | 2 | 40 | 5.59 |
| Yuhui Shi | 3 | 4397 | 435.39 |
| Li Zhao | 4 | 380 | 27.36 |
| Minghai Xin | 5 | 55 | 5.70 |