DocumentCode
353003
Title
Asymptotic behavior of ACMA
Author
Van der Veen, Alle-Jan
Author_Institution
Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands
Volume
5
fYear
2000
fDate
2000
Firstpage
2453
Abstract
The algebraic constant modulus algorithm (ACMA) is a noniterative blind source separation algorithm. It computes jointly beamforming vectors for all constant modulus sources as the solution of a joint diagonalization problem. In this paper we analyze its asymptotic properties and show that (unlike the iterative CMA) it converges to the Wiener solution in samples or SNR. We also sketch its connection to the related JADE algorithm
Keywords
Gaussian noise; algebra; array signal processing; blind equalisers; eigenvalues and eigenfunctions; ACMA; JADE algorithm; SN; Wiener solution; algebraic constant modulus algorithm; asymptotic behavior; beamforming vectors; constant modulus sources; joint diagonalization problem; noniterative blind source separation algorithm; Additive noise; Array signal processing; Blind equalizers; Blind source separation; Eigenvalues and eigenfunctions; Gaussian noise; Iterative algorithms; Linear systems; Signal detection; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on
Conference_Location
Istanbul
ISSN
1520-6149
Print_ISBN
0-7803-6293-4
Type
conf
DOI
10.1109/ICASSP.2000.860927
Filename
860927
Link To Document