TY - JOUR
T1 - Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization
AU - Nelatury, Sudarshan Rao
AU - Rao, Sathyanarayan S.
PY - 2002/6
Y1 - 2002/6
N2 - The constant modulus algorithm (CMA) is an excellent technique for blind channel equalization. Recently signed error version of CMA (SE-CMA) and dithered signed error version (DSE-CMA) have been proposed which afford overall computational efficiency. We propose three different error functions for faster convergence. This would be essential for communication systems, which cannot afford a high startup delay or for systems, where the channel's impulse response is rapidly fluctuating. One of these algorithms relies on the idea of a variable step size, which increases the rate of convergence.
AB - The constant modulus algorithm (CMA) is an excellent technique for blind channel equalization. Recently signed error version of CMA (SE-CMA) and dithered signed error version (DSE-CMA) have been proposed which afford overall computational efficiency. We propose three different error functions for faster convergence. This would be essential for communication systems, which cannot afford a high startup delay or for systems, where the channel's impulse response is rapidly fluctuating. One of these algorithms relies on the idea of a variable step size, which increases the rate of convergence.
UR - http://www.scopus.com/inward/record.url?scp=0036602419&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036602419&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2002.1010603
DO - 10.1109/TCOMM.2002.1010603
M3 - Article
AN - SCOPUS:0036602419
SN - 0090-6778
VL - 50
SP - 872
EP - 876
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 6
ER -