Linear Programming Algorithms for Sparse Filter Design
In designing discrete-time filters, the length of the impulse response is often used as an indication of computational cost. In systems where the complexity is dominated by arithmetic operations, the number of nonzero coefficients in the impulse response may be a more appropriate metric to consider...
Main Authors: | Baran, Thomas A., Wei, Dennis, Oppenheim, Alan V. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/69889 https://orcid.org/0000-0003-0647-236X |
Similar Items
-
A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
by: Wei, Dennis, et al.
Published: (2014) -
Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms
by: Wei, Dennis, et al.
Published: (2014) -
Sparsity Maximization under a Quadratic Constraint with Applications in Filter Design
by: Wei, Dennis, et al.
Published: (2010) -
Non-convex optimization for the design of sparse FIR filters
by: Wei, Dennis
Published: (2010) -
Sparse FIR filter design and prediction
by: Zhao, Heng
Published: (2015)