Frequency-Domain Maximum-Likelihood Adaptive Filtering.

摘要

Recent intensive study of adaptive (gradient-search) filtering in the time domain has not solved the problems with rate-of-convergence problem, which is a major difficulty with this technique. A recent study based on a set of time-stationary synthetic data shows that the time-domain maximum-likelihood adaptive filter converges very slowly to the optimum filter. After 3300 iterations of adaption with an adaptive rate of 10 percent of maximum value, the adaptive filter is still about 4 db away from the optimum filter in the sense of mean-square outputs. Time-domain adaptive filtering necessitates using only one convergence parameter for all filter coefficients, which may cause slow convergence for some data. Frequency-domain adaptive filtering may solve this problem, since different convergence parameters can be used for different frequency components. This report describes a frequency-domain maximum-likelihood adaptive-filtering algorithm analogous to the time-domain adaptive algorithm. This algorithm was used with a set of synthetic stationary data previously used for a time-domain adaptive-filtering study. Different filter lengths and convergence parameters were used. Results are compared with beamsteer and time-domain adaptive filter. (Author)