Study of a Fast Method to Calculate Inverse Filters
In certain systems it is very important to calculate quickly an inverse filter that has a large number of taps. Several approaches to solving normal equations are investigated. One fast method uses conjugate gradients in the frequency domain. To enhance this method a fast method that calculates only...
Gespeichert in:
Veröffentlicht in: | Journal of the Audio Engineering Society 1998-07, Vol.46 (7/8), p.611-620 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In certain systems it is very important to calculate quickly an inverse filter that has a large number of taps. Several approaches to solving normal equations are investigated. One fast method uses conjugate gradients in the frequency domain. To enhance this method a fast method that calculates only linear convolutions in conjugate gradients by FFT is proposed. Simulation results show that the sum of the squares of the residual errors of our method is as low as that of the Levinson algorithm, which is slower than the method proposed. |
---|---|
ISSN: | 1549-4950 0004-7554 |