Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms
Name
Oppenheim_sparse filter.pdf
Size
4.23 MB
Format
Adobe PDF
Checksum (MD5)
e78d58782c25ff30cb0b7108524a6b9d
Author(s)
Wei, Dennis
Sestok, Charles K.
Oppenheim, Alan V.
Date Issued
January 2013
Journal
IEEE Transactions on Signal Processing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Wei, Dennis, Charles K. Sestok, and Alan V. Oppenheim. “Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms.” IEEE Transactions on Signal Processing 61, no. 4 (February 2013): 857–870.
Version
Author's final manuscript
Abstract
This paper considers three problems in sparse filter design, the first involving a weighted least-squares constraint on the frequency response, the second a constraint on mean squared error in estimation, and the third a constraint on signal-to-noise ratio in detection. The three problems are unified under a single framework based on sparsity maximization under a quadratic performance constraint. Efficient and exact solutions are developed for specific cases in which the matrix in the quadratic constraint is diagonal, block-diagonal, banded, or has low condition number. For the more difficult general case, a low-complexity algorithm based on backward greedy selection is described with emphasis on its efficient implementation. Examples in wireless channel equalization and minimum-variance distortionless-response beamforming show that the backward selection algorithm yields optimally sparse designs in many instances while also highlighting the benefits of sparse design.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tsp.2012.2229996
