Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

TSP
2008

favoriteEmaildiscussreport

69views more TSP 2008»

Stochastic Stability Analysis for the Constant-Modulus Algorithm

13 years 4 months ago

Stochastic Stability Analysis for the Constant-Modulus Algorithm

Download www.lps.usp.br

We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of the CM cost function. Our model highlights the influence of the signal constellation used in the transmission system: for smaller variation in the modulus of the transmitted symbols, the algorithm will be more robust, and the steady-state misadjustment will be smaller. The theoretical results are validated through several simulations, for long and short filters and channels.

Victor H. Nascimento, M. T. M. Silva

Real-time Traffic

Constant-modulus Algorithm | Easy-to-compute Approximate Bound | Signal Constellation | TSP 2008 |

claim paper

Related Content

» Tracking analysis of the constant modulus algorithm

» Avoiding divergence in the constant modulus algorithm

» Blind Adaptive Constrained ConstantModulus ReducedRank Interference Suppression Algorithms...

» Stability analysis of the consensusbased distributed LMS algorithm

» Communication convergence and stochastic stability in selfassembly

» Bank management via stochastic optimal control

» Multistage KMeans Clustering for Scenario Tree Construction

» A stochastically stable solution to the problem of robocentric mapping

» The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2008
Where	TSP
Authors	Victor H. Nascimento, M. T. M. Silva

Comments (0)