Applications of Efficient Subset Selection to Digital Filtering and to Signal Resolution

摘要

The subset selection algorithm is extended to search for a best subset from a large set of complex-valued basis functions. This algorithm is used to design digital finite-duration impulse response (FIR) filters having fewer coefficients than conventional FIR filters. An optimum conventional FIR filter is derived which has best uniform spacing of the fixed number of samples which are to be used, and examples are presented which show that, for the same number of coefficients, the complex-subset-selection filter can give better results than the optimum conventional filter. The complex subset selection method is also applied to estimation of the frequencies of sinusoids in the presence of noise. A windowing technique is introduced to increase the efficiency and accuracy of the algorithm for frequency estimates. The results are compared with Cramer-Rao bounds. (Author)