.png){kind=icon}
.png){kind=icon}
Return
Constant modulus algorithms using hyperbolic Givens rotations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2014.04.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose two new algorithms to minimize the constant modulus (CM) criterion in the context of blind source separation. The first algorithm, referred to as Givens CMA (G-CMA), uses unitary Givens rotations and proceeds in two stages: prewhitening step, which reduces the channel matrix to a unitary one followed by a separation step where the resulting unitary matrix is computed as a product of Givens rotations. However, for small sample sizes, the prewhitening does not make the channel matrix close enough to unitary and hence applying Givens rotations alone does not provide satisfactory performance. To remediate to this problem, we propose to use Hyperbolic rotations in conjunction with Givens rotations. This second algorithm, referred to as Hyperbolic G-CMA (HG-CMA), is shown to outperform the G-CMA as well as the Analytical CMA (ACMA). The last part of this paper is dedicated to an efficient adaptive implementation of the HG-CMA and to performance assessment through numerical experiments. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Blind source separation
Constant modulus algorithm
Adaptive CMA
Sliding window
Hyperbolic rotations
Givens rotations
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W