A fast linear programming algorithm for blind equalization

Zhi Ding; Zhi Quan Luo

doi:10.1109/26.870004

A fast linear programming algorithm for blind equalization

Zhi Ding, Zhi Quan Luo

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	1432-1436
Number of pages	5
Journal	IEEE Transactions on Communications
Volume	48
Issue number	9
DOIs	https://doi.org/10.1109/26.870004
State	Published - 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

Publisher link

10.1109/26.870004

Find It

Find It at U of M Libraries

Cite this

@article{9b86af034e794d07bfcd667dfb6707ae,

title = "A fast linear programming algorithm for blind equalization",

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.",

keywords = "Blind deconvolution, Convexity, Equalization, Global convergence, Intersymbol interference, Linear programming",

author = "Zhi Ding and Luo, {Zhi Quan}",

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.",

year = "2000",

doi = "10.1109/26.870004",

language = "English (US)",

volume = "48",

pages = "1432--1436",

journal = "IEEE Transactions on Communications",

issn = "1558-0857",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - A fast linear programming algorithm for blind equalization

AU - Ding, Zhi

AU - Luo, Zhi Quan

N1 - 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.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - Blind deconvolution

KW - Convexity

KW - Equalization

KW - Global convergence

KW - Intersymbol interference

KW - Linear programming

UR - http://www.scopus.com/inward/record.url?scp=0034266954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034266954&partnerID=8YFLogxK

U2 - 10.1109/26.870004

DO - 10.1109/26.870004

M3 - Article

AN - SCOPUS:0034266954

SN - 1558-0857

VL - 48

SP - 1432

EP - 1436

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 9

ER -

A fast linear programming algorithm for blind equalization

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this