Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Linear Programming Algorithms for Sparse Filter Design

Linear Programming Algorithms for Sparse Filter Design

Thumbnail Image
Download
Name

Baran-2010-Linear Programming Algorithms for Sparse Filter Design.pdf

Size

689.37 KB

Format

Adobe PDF

Checksum (MD5)

18d208140b1626fe76ca3388b5641055

Author(s)
Baran, Thomas A.
•
Wei, Dennis
•
Oppenheim, Alan V.
Date Issued
March 2010
Journal
IEEE Transactions on Signal Processing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Baran, T., D. Wei, and A.V. Oppenheim. “Linear Programming Algorithms for Sparse Filter Design.” IEEE Transactions on Signal Processing 58.3 (2010): 1605–1617. Web. 30 Mar. 2012. © 2010 Institute of Electrical and Electronics Engineers
Version
Final published version
Abstract
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 instead, and computational savings are realized by omitting arithmetic operations associated with zero-valued coefficients. This metric is particularly relevant to the design of sensor arrays, where a set of array weights with many zero-valued entries allows for the elimination of physical array elements, resulting in a reduction of data acquisition and communication costs. However, designing a filter with the fewest number of nonzero coefficients subject to a set of frequency-domain constraints is a computationally difficult optimization problem. This paper describes several approximate polynomial-time algorithms that use linear programming to design filters having a small number of nonzero coefficients, i.e., filters that are sparse. Specifically, we present two approaches that have different computational complexities in terms of the number of required linear programs. The first technique iteratively thins the impulse response of a non-sparse filter until frequency-domain constraints are violated. The second minimizes the 1-norm of the impulse response of the filter, using the resulting design to determine the coefficients that are constrained to zero in a subsequent re-optimization stage. The algorithms are evaluated within the contexts of array design and acoustic equalization.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/69889
DOI of Published Version
https://doi.org/10.1109/tsp.2009.2036471
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.