A fast linear programming algorithm for blind equalization

Zhi Ding, Zhi Quan Luo

Research output: Contribution to journalArticlepeer-review

42 Scopus citations

Abstract

A fast implementation of a special non-MSE cost function for blind equalization is presented here. This baud-rate equalization algorithm is based on a convex cost function coupled with a simple linear constraint on the equalizer parameters. For a generic class of channels with persistently exciting quadrature amplitude modulation input signals, this new algorithm allows the convergence of equalizer parameters to a unique global minimum achieving intersymbol interference suppression and carrier phase recovery.

Original languageEnglish (US)
Pages (from-to)1432-1436
Number of pages5
JournalIEEE Transactions on Communications
Volume48
Issue number9
DOIs
StatePublished - 2000

Bibliographical note

Funding Information:
Paper approved by R. A. Kennedy, the Editor for Data Communications, Modulation, and Signal Design of the IEEE Communications Society. Manuscript received February 22, 1999; revised December 15, 1999. This work was supported in part by the U.S. National Science Foundation under Grant CCR-9996206 and in part by the Natural Sciences and Engineering Research Council of Canada under Grant OPG0090391.

Keywords

  • Blind deconvolution
  • Convexity
  • Equalization
  • Global convergence
  • Intersymbol interference
  • Linear programming

Fingerprint Dive into the research topics of 'A fast linear programming algorithm for blind equalization'. Together they form a unique fingerprint.

Cite this