An analytical constant modulus algorithm
van der Veen, A.-J.
Paulraj, A.
Dept. of Comput. Sci., Stanford Univ., CA;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: May 1996
Volume: 44,
Issue: 5
On page(s): 1136-1155
ISSN: 1053-587X
References Cited: 55
CODEN: ITPRED
INSPEC Accession Number: 5290110
Digital Object Identifier: 10.1109/78.502327
Current Version Published: 2002-08-06
Abstract
Iterative constant modulus algorithms such as Godard (1980) and
CMA have been used to blindly separate a superposition of cochannel
constant modulus (CM) signals impinging on an antenna array. These
algorithms have certain deficiencies in the context of convergence to
local minima and the retrieval of all individual CM signals that are
present in the channel. We show that the underlying constant modulus
factorization problem is, in fact, a generalized eigenvalue problem, and
may be solved via a simultaneous diagonalization of a set of matrices.
With this new analytical approach, it is possible to detect the number
of CM signals present in the channel, and to retrieve all of them
exactly, rejecting other, non-CM signals. Only a modest amount of
samples is required. The algorithm is robust in the presence of noise
and is tested on measured data collected from an experimental set-up
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
