Name
Abstract | ||
|---|---|---|
An algorithm for designing a Chebyshev optimal FIR filter that approximates an arbitrary complex-valued frequency response is presented. This algorithm computes the optimal filter by solving the dual to the filter design problem. It is guaranteed to converge theoretically and requires O(N2) computations per iteration for a filter of length N. For the first time, properties of the optimal filter are derived, and the case where the desired filter has arbitrary constant group delay is studied in detail |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/78.193198 | Signal Processing, IEEE Transactions |
Keywords | Field | DocType |
computational complexity,convergence of numerical methods,digital filters,filtering and prediction theory,Chebyshev optimal FIR filter,O(N2) computations per iteration,arbitrary complex-valued frequency,arbitrary constant group delay,convergence,filter design problem dual,filter length,optimal filter properties | Mathematical optimization,Control theory,Prototype filter,Low-pass filter,Adaptive filter,Kernel adaptive filter,All-pass filter,Parks–McClellan filter design algorithm,Mathematics,Filter design,Butterworth filter | Journal |
Volume | Issue | ISSN |
41 | 2 | 1053-587X |
Citations | PageRank | References |
24 | 2.32 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alkhairy, A.S. | 1 | 24 | 2.32 |
| Christian, K.G. | 2 | 24 | 2.32 |
| Lim, J.S. | 3 | 127 | 72.56 |