The effects of finite bit precision for a VLSI implementation of the Constant Modulus Algorithm

被引：1
|
作者：
Litwin, LR [1 ]
Endres, TJ [1 ]
Hulyalkar, SN [1 ]
Zoltowski, MD [1 ]
机构：
[1] Purdue Univ, Dept Elect Engn, W Lafayette, IN 47906 USA
来源：
ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI | 1999年
关键词：
D O I：
10.1109/ICASSP.1999.758323
中图分类号：
O42 [声学];
学科分类号：
070206 ; 082403 ;
摘要：
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 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 CR;ZA. In this paper we examine how implementing CMA using finite bit precisions affects the algorithm's performance.
引用
收藏
页码：2013 / 2016
页数：4
相关论文
共 50 条
  • [1] A generalized block constant modulus algorithm and its VLSI architecture
    Ochi, H
    Onaga, K
    Kinjo, S
    40TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1 AND 2, 1998, : 853 - 856
  • [2] A finite-interval constant modulus algorithm
    Regalia, PA
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 2285 - 2288
  • [3] A bit-serial systolic algorithm and VLSI implementation for RSA
    Zhang, CN
    Xu, Y
    Wu, CC
    1997 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS 1 AND 2: PACRIM 10 YEARS - 1987-1997, 1997, : 523 - 526
  • [4] MMSE-Based Block Implementation of Constant Modulus Algorithm
    Bao, Jianrong
    Zhan, Yafeng
    Lu, Jianhua
    2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 1020 - 1023
  • [5] VLSI Design of a 3-bit Constant-Modulus Precoder for Massive MU-MIMO
    Castaneda, Oscar
    Jacobsson, Sven
    Durisi, Giuseppe
    Goldstein, Tom
    Studer, Christoph
    2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [6] Scheduling of Iterative Algorithms with Matrix Operations for Efficient FPGA Design—Implementation of Finite Interval Constant Modulus Algorithm
    Přemysl Šůcha
    Zdeněk Hanzálek
    Antonín Heřmánek
    Jan Schier
    The Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology, 2007, 46 : 35 - 53
  • [7] Scheduling of iterative algorithms with matrix operations for efficient FPGA design-implementation of finite interval constant modulus algorithm
    Sucha, Premysl
    Hanzalek, Zdenek
    Hermanek, Antonin
    Schier, Jan
    JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2007, 46 (01): : 35 - 53
  • [8] An analytical constant modulus algorithm
    vanderVeen, AJ
    Paulraj, A
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1996, 44 (05) : 1136 - 1155
  • [9] The effects of PN sequences on the misconvergence of the constant modulus algorithm (CMA)
    Axford, RA
    Milstein, LB
    Zeidler, JR
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1998, 46 (02) : 519 - 523
  • [10] A VLSI IMPLEMENTATION OF THE SIMPLEX ALGORITHM
    BERTOSSI, AA
    BONUCCELLI, MA
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (02) : 241 - 247
12345