Name
Abstract | ||
|---|---|---|
The matrix decomposition (MD) based FIR filter design technique can synthesize a traditional FIR filter with much less implementation complexity. A scheme for obtaining more sparse coefficients of a MD-FIR filter is proposed, which consists of two parts. The first part is the previous procedure of designing a MD-FIR filter (i.e., design an initial MD-FIR filter using a certain MD method and optimize its coefficients). The second part is the proposed procedure of obtaining more sparse coefficients, where the MD-FIR filters’ coefficients also need to be optimized. The performances of the various initial MD-FIR filters, which are obtained based on the various MD methods, in the implementation of this scheme are experimentally compared. The MD-FIR filter’s coefficients can be effectively optimized by the trust-region iterative-gradient-searching (TR-IGS) algorithm. We present further results on the TR-IGS. The error bound for each iteration of TR-IGS is analyzed. A convergent online implementation scheme of the TR-IGS is presented and analyzed theoretically and experimentally. The proof of the convergence is provided. A sufficient condition for determining whether a theoretical termination point of the scheme is a strict local optimum point is provided. The step-size optimization problem for the TR-IGS is analyzed theoretically and experimentally. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TCSI.2019.2946174 | IEEE Transactions on Circuits and Systems I: Regular Papers |
Keywords | Field | DocType |
Finite impulse response filters,Matrix decomposition,Hardware,Complexity theory,Optimization,Frequency-domain analysis | Control theory,Matrix decomposition,Algorithm,Finite impulse response,Mathematics | Journal |
Volume | Issue | ISSN |
67 | 2 | 1549-8328 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Wang | 1 | 18 | 4.34 |
| Zhao Zhijing | 2 | 0 | 0.68 |
| Li Zhao | 3 | 198 | 22.70 |