For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Reduction of Computational Complexity in the IA Algorithm
Isao NAKANISHI Yoshio ITOH Yutaka FUKUI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Digital Signal Processing
adaptive filter, IA algorithm, reduction of computational complexity, switching algorithm,
Full Text: PDF>>
For reduction of computational complexity in the IA algorithm, the thinned-out IA algorithm in which only one step size is updated every iteration is proposed and is complementarily switched with the HA algorithm according to the convergence. The switching is determined by using the gradient of the error signal power. These are investigated through the computer simulations.