By Topic

Proposed bit precisions for a VLSI implementation of the constant modulus algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Litwin, L.R., Jr. ; Dept. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; Endres, T.J. ; Hulyalkar, S.N. ; Zoltowski, M.D.

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. When implementing the CMA in a VLSI design, the bit precisions used to represent the mathematical quantities must be carefully chosen in order to reduce performance degradation due to finite bit precision effects. The motivation for this paper is a VLSI implementation of a high data rate, fractionally spaced, linear forward equalizer whose taps are adjusted using CMA. We propose a set of bit precisions and show how the CMA performs using those precisions to equalize 64-QAM data. An interesting finding is that the MSEs that result from using our proposed bit precisions are within 1 dB of the MSEs for the floating point version of CMA

Published in:

Signal Processing Advances in Wireless Communications, 1999. SPAWC '99. 1999 2nd IEEE Workshop on

Date of Conference: