A Fast Decoding Algorithm for Non-orthogonal Frequency Division Multiplexing Signals

A fast decoding algorithm based on Semidefinite relaxation combined with cutting plane is proposed for the detection of Non-orthogonal frequency division multiplexing (NFDM) signals. It shows that maximum likelihood (ML) detection of NFDM signals can be transformed into a semidefinite programming pr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2007 Second International Conference in Communications and Networking in China s. 595 - 598
Hlavní autori: Xing Yang, Wenbao Ai, Tianping Shuai, Daoben Li
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2007
Predmet:
AWGN
Computational complexity
Detectors
Frequency division multiplexing
Interference
Maximum likelihood decoding
Maximum likelihood detection
OFDM
Shape
Signal detection
ISBN:9781424410088, 1424410088
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A fast decoding algorithm based on Semidefinite relaxation combined with cutting plane is proposed for the detection of Non-orthogonal frequency division multiplexing (NFDM) signals. It shows that maximum likelihood (ML) detection of NFDM signals can be transformed into a semidefinite programming problem by relaxing rank one constraint. In order to tighten the performance gap between the relaxed combinatorial optimization problem and the optimum ML detection one, adding cutting planes are necessary. Simulations show that the optimum ML performance can be approached by the proposed algorithm. The loss in signal-to-noise ratio (SNR) compared with the ML detector is within ldB for the worst case. Moreover, the proposed algorithm's computational complexity is only proportional to a polynomial of the number of subcarriers rather than an exponential one of the optimum ML algorithm.
ISBN:9781424410088
1424410088
DOI:10.1109/CHINACOM.2007.4469461