منابع مشابه
An analytical constant modulus algorithm
Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of co-channel 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. In this paper, we show that the underlyin...
متن کاملAn analysis of constant modulus algorithm for array signal processing
The constant modulus (CM) cost function is analyzed for array signal processing. The analysis includes arbitrary source types. It is shown that CM receivers have the signal space property except in two special cases. Local minima of CM cost function are completely characterized for the noiseless case. In the presence of measurement noise, the existence of CM local minima in the neighborhood of ...
متن کاملThe fractionally spaced vector constant modulus algorithm
The vector constant modulus algorithm (VCMA) was recently introduced as an extension of CMA which can equalize data from shaped sources having nearly Gaussian marginal distributions. Some simple changes in the structure of VCMA allow it to be used in fractionally-spaced equalizers with their attendant benefits. Although developed with shell mapping in mind, VCMA can also equalize data from othe...
متن کاملConvergence analysis of the constant modulus algorithm
We study the global convergence of the stochastic gradient constant modulus algorithm (CMA) in the absence of channel noise as well as in the presence of channel noise. The case of fractionally spaced equalizer and/or multiple antenna at the receiver is considered. For the noiseless case, we show that with proper initialization, and with small step size, the algorithm converges to a zero-forcin...
متن کاملThe dithered signed-error constant modulus algorithm
Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In particular, the Constant Modulus Algorithm (CMA) has become a favorite of practitioners due to its LMS-like complexity and desirable robustness properties. The desire for further reduction in computational complexity has motivated signed-error versions of CMA, which have been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 1996
ISSN: 1053-587X
DOI: 10.1109/78.502327