By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xing Yang ; School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China. Email: sheepstar ; Wenbao Ai ; Tianping Shuai ; Daoben Li

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.

Published in:

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Date of Conference:

22-24 Aug. 2007