Comparison of Convergence Property among Adaptive Arrays

Masaharu FUJITA  

Publication
IEICE TRANSACTIONS (1976-1990)   Vol.E64   No.5   pp.314-318
Publication Date: 1981/05/25
Online ISSN: 
DOI: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Antenna and Propagation
Keyword: 


Full Text: PDF>>
Buy this Article




Summary: 
Convergence properties of adaptive algorithms are analyzed and compared with mutually by using the differential equation approach. Evaluations of the convergence rates of the algorithms are made by the eigenvalues of matrix coefficient which are relating to the radio environment and the guideline of adaptation. The result shows that the adaptive array under directional constraint is the most applicable to communications for fixed stations or stations in predictable motion despite of its slower convergence rate, because it requires only an approximated information about the desired signal. But, for a desired signal whose incident direction is unknown at the receiver, only the least-mean-square-error adaptive array can extract the desired signal from noisy environment, if a synchronization between the received desired signal and the internal reference signal is kept.