IEICE TRANSACTIONS on Fundamentals
Reduction of Computational Complexity in the IA Algorithm
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.11 pp.1918-1921
- Publication Date
- 1996/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Digital Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Isao NAKANISHI, Yoshio ITOH, Yutaka FUKUI, "Reduction of Computational Complexity in the IA Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 11, pp. 1918-1921, November 1996, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_11_1918/_p
Copy
@ARTICLE{e79-a_11_1918,
author={Isao NAKANISHI, Yoshio ITOH, Yutaka FUKUI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reduction of Computational Complexity in the IA Algorithm},
year={1996},
volume={E79-A},
number={11},
pages={1918-1921},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Reduction of Computational Complexity in the IA Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1918
EP - 1921
AU - Isao NAKANISHI
AU - Yoshio ITOH
AU - Yutaka FUKUI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1996
AB - 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.
ER -
English
