A new quasi-optimal detection algorithm for a non orthogonal spectrally efficient FDM

Authors:
Ioannis Kanaras;Arsenia Chorti;Miguel Rodrigues;Izzat Darwazeh
Affiliations:
EEE Dep., University College London, London, UK;CCM Dep., EIS, Middlesex University, Hendon, London, UK;Dep. of Computer Science, University of Porto, Porto, Portugal;EEE Dep., University College London, London, UK
Venue:
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Year:
2009

Citing 8
Cited 1

Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm

SIAM Journal on Matrix Analysis and Applications
Convex Optimization

Convex Optimization
Spectrally efficient FDM signals: bandwidth gain at the expense of receiver complexity

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
Efficient Complex Sphere Decoding for MC-CDMA Systems

IEEE Transactions on Wireless Communications
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
The application of semidefinite programming for detection in CDMA

IEEE Journal on Selected Areas in Communications

A fast constrained sphere decoder for ill conditioned communication systems

IEEE Communications Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Non-orthogonal Spectrally Efficient Frequency Division Multiplexing (SEFDM) signals of a small dimensionality can be optimally detected using the Sphere Decoder (SD) algorithm. However, the employment of such detectors is restricted by two factors; the ill-conditioning of the SEFDM projections matrix in the system linear statistical model and the sensitivity of the SD complexity to noise. A solution to the latter could be given by a fixed complexity detection based on the Semidefinite Programming (SDP). Notwithstanding, SDP error performance appears to be suboptimal. In order to diminish the error performance gap between the SDP and the optimal detector we propose a modified SD that investigates only the points of the SEFDM lattice within a hypersphere whose size is determined by a first SDP estimate. In addition, the new SD tree is pruned to include only the branches that have a heuristically predefined Hamming distance from the SDP estimate. We show that the introduced scheme achieves a quasi optimal Bit Error Rate (BER) for an SEFDM scheme with 20% spectral gain compared to Orthogonal FDM (OFDM). Moreover, we demonstrate by simulation that the new scheme is superior in terms of computational effort compared to an equivalent SDP - brute force Maximum Likelihood (ML) scheme. Finally, it is shown that the new pruned SD reduces by more than 30% the number of the visits to the nodes of the SD tree made by the conventional SD using the Schnorr Euchner (SE) reordering strategy.