dc.contributor.author | Wei, Dennis | |
dc.contributor.author | Sestok, Charles K. | |
dc.contributor.author | Oppenheim, Alan V. | |
dc.date.accessioned | 2014-09-30T19:08:51Z | |
dc.date.available | 2014-09-30T19:08:51Z | |
dc.date.issued | 2013-01 | |
dc.date.submitted | 2012-08 | |
dc.identifier.issn | 1053-587X | |
dc.identifier.issn | 1941-0476 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/90495 | |
dc.description.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. | en_US |
dc.description.sponsorship | Texas Instruments Leadership University Consortium Program | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/tsp.2012.2229996 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Oppenheim, Alan V. | en_US |
dc.relation.journal | IEEE Transactions on Signal Processing | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Wei, Dennis; Sestok, Charles K.; Oppenheim, Alan V. | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-0647-236X | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |