article · 1997

Computationally Efficient Blind Equalization

D. R. Brown, Brown Schniter, C. R. Johnson

Cited by 0Abstract and details only

Abstract

: Adaptive blind equalization has gained wide-spread use in communication receivers that operate without training signals. In particular, the Constant Modulus Algorithm (CMA) [6, 10] has become a favorite of practitioners due to its LMS-like complexity and desirable robustness properties [4, 5, 14]. This paper presents a signed-error version of CMA (SE-CMA) which is motivated by a further reduction in the computation complexity of the equalizer coefficient update. The authors investigate the performance of SE-CMA and establish connections to previously proposed signed blind algorithms. A novel dithered signed blind algorithm (DSE-CMA) is proposed which overcomes significant SE-CMA convergence issues and possesses similar robustness properties to the standard (i.e. unsigned) CMA. 1 Introduction Digital communication through band-limited or multipath channels results in intersymbol interference (ISI) which, if left uncompensated, can cause unnecessarily high symbol error rates (SER) at ...

Cite this paper

APA 7

Brown, D. R., Schniter, B., & Johnson, C. R. (1997). Computationally Efficient Blind Equalization.

MLA 9

Brown, D. R., et al. “Computationally Efficient Blind Equalization.” 1997.

Chicago

Brown, D. R., Brown Schniter, and C. R. Johnson. 1997. “Computationally Efficient Blind Equalization.”

Harvard

Brown, D.R., Schniter, B. and Johnson, C.R. (1997) ‘Computationally Efficient Blind Equalization’.

BibTeX

@article{brown1997computationally,
  title = {{Computationally Efficient Blind Equalization}},
  author = {Brown, D. R. and Schniter, Brown and Johnson, C. R.},
  year = {1997}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.