Comparison of two recursive constant modulus algorithms

0411133 20240103182304.320060210235959.9 80-227-1939-0 Comparison of two recursive constant modulus algorithms Bratislava Slovak University of Technology 2003 4 s. Proceedings of the 4th Electronic Circuits and Systems Conference159-162ButašJ.StopjakováV. blind equalization constant modulus algorithm cav_un_auth*0101105 Heřmánek Antonín UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0021102 Regalia P. FR 09G 09H CEZ:AV0Z1075907 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. cav_un_auth*0213064 International Conference on Electronic Circuits and Systems. /4./ Bratislava SK 11.09.2003-12.09.2003 JC ZS http://hdl.handle.net/11104/0131220 UTIA-B 20030120 2003 2003 Bratislava Slovak University of Technology 80-227-1939-0 Proceedings of the 4th Electronic Circuits and Systems Conference 159 162 Butaš J. 340 Stopjaková V. 340