Comparison of two recursive constant modulus algorithms

0411133 - UTIA-B 20030120 RIV SK eng C - Conference Paper (international conference)
Heřmánek, Antonín - Regalia, P.
Comparison of two recursive constant modulus algorithms.
Bratislava: Slovak University of Technology, 2003. ISBN 80-227-1939-0. In: Proceedings of the 4th Electronic Circuits and Systems Conference. - (Butaš, J.; Stopjaková, V.), s. 159-162
[International Conference on Electronic Circuits and Systems. /4./. Bratislava (SK), 11.09.2003-12.09.2003]
Institutional research plan: CEZ:AV0Z1075907
Keywords : blind equalization * constant modulus algorithm
Subject RIV: JC - Computer Hardware ; Software

In the paper we compare two recursive constant modulus algorithms for blind equalization: the gradient steap descent CMA and recursive Finite Interval Constant Modulus Algorithm (FI-CMA). Algorithms are tested on the BPSK random data. Their convergence speed and computation requirements is discussed.
Permanent Link: http://hdl.handle.net/11104/0131220