A Reweighted Least Squares Approach to QAM Detector for Blind Equalization

This letter proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in blind equalization. Because the QAM detection problem is a non-convex combinatorial optimization problem, it is relaxed into a problem of minimizing the sum of logarithmic functions in ord...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 18; číslo 4; s. 259 - 262
Hlavní autoři: Konishi, Katsumi, Furukawa, Toshihiro
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.04.2011
Témata:
Blind equalization
Blind equalizers
iteratively reweighted least squares
maximum likelihood detection
MIMO
Polynomials
Programming
Quadrature amplitude modulation
Signal processing algorithms
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This letter proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in blind equalization. Because the QAM detection problem is a non-convex combinatorial optimization problem, it is relaxed into a problem of minimizing the sum of logarithmic functions in order to overcome the combinatorial complexity. To find a local optimal solution of the problem, an iterative reweighted least squares based algorithm is proposed. Simulation results show that the proposed algorithm improves the accuracy of QAM detection in blind equalization.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2011.2118202