Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
DOI: 10.1109/icassp.2005.1416148
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Version of the Algebraic Constant Modulus Algorithm

Abstract: The Algebraic Constant Modulus Algorithm (ACMA) is a very effective block-algorithm for blind source separation. A particular feature is that it finds beamformers for all sources simultaneously. However, in cases with continuously transmitting sources and varying environments, data-adaptive algorithms may be more appropriate. In this paper, we derive an adaptive version of the ACMA, with a reasonable computational complexity. Simulations indicate that it is reliably tracking beamformers to all sources even in … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…The computation of eigenvalues also plays a central role in the derivation of the algebraic constant-modulus algorithm [17]- [19].…”
Section: Basic Approachmentioning
confidence: 99%
“…The computation of eigenvalues also plays a central role in the derivation of the algebraic constant-modulus algorithm [17]- [19].…”
Section: Basic Approachmentioning
confidence: 99%