The effects of finite bit precision for a VLSI implementation of the constant modulus algorithm
L.R. Litwin, T.J. Endres, Samir N. Hulyalkar, M.D. Zoltowski · 1999
One of the most popular blind equalization techniques is the constant modulus algorithm (CMA), and it has gained popularity in the literature and in practice because of its LMS-like complexity and its robustness to non-ideal, but practical, conditions. Although the CMA has been well-studied in the literature, these analyses have typically implemented the algorithm using "infinite" precision arithmetic. The motivation for this paper is a VLSI implementation of a high data rate, fractionally spaced, linear forward equalizer whose taps are adjusted using the CMA. We examine how implementing the CMA using finite bit precision affects the algorithm's performance.