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.
Authors:
Irisawa, Hideki; Shimada, Shoji; Hokari, Haruhide; Hosoya, Shinichi
Affiliations:
Nagaoka University of Technology, Nagaoka city, Niigata, Japan ; Japan Kyastem Co. Ltd., Tachikawa city, Tokyo, Japan(See document for exact affiliation information.)
JAES Volume 46 Issue 7/8 pp. 611-620; July 1998
Publication Date:
July 1, 1998
Click to purchase paper as a non-member or you can login as an AES member to see more options.
No AES members have commented on this paper yet.
To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.
If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.