Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ights with many zero-valued entries allows for the elimination of physical array elements, resulting in a reduction of data acquisition and communication costs. Hover, designing a filter with the fest number of nonzero coefficients subject to a set of frequency-domain constraints is a computationally difficult optimization problem.  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,  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.
['Thomas A. Baran', 'Dennis Wei', 'Alan V. Oppenheim']
I am writing a research paper on a idea Linear Programming Algorithms for Sparse Filter Design
[{"from": "human", "value": "I am writing a research paper on a idea Linear Programming Algorithms for Sparse Filter Design"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ights with many zero-valued entries allows for the elimination of physical array elements, resulting in a reduction of data acquisition and communication costs. Hover, designing a filter with the fest number of nonzero coefficients subject to a set of frequency-domain constraints is a computationally difficult optimization problem.  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,  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."}]