pith. sign in

arxiv: 1808.07232 · v2 · pith:P4372X3Onew · submitted 2018-08-22 · 💻 cs.IT · math.IT

Semidefinite Relaxation Based Blind Equalization using Constant Modulus Criterion

classification 💻 cs.IT math.IT
keywords blindalgorithmsambiguityconstantcriterionequalizationmodulusphase
0
0 comments X
read the original abstract

Blind equalization is a classic yet open problem. Statistic-based algorithms, such as constant modulus (CM), were widely investigated. One inherent issue with blind algorithms is the phase ambiguity of equalized signals. In this letter, we propose a novel scheme based on CM criterion and take advantage of the asymmetric property in a class of LDPC codes to resolve the phase ambiguity. Specifically, a new formulation with modified CM objective function and relaxed code constraints is presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.