Reference : On low complexity detection for QAM isomorphic constellations
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Electrical & electronics engineering
http://hdl.handle.net/10993/33280
On low complexity detection for QAM isomorphic constellations
English
Kayhan, Farbod mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Dec-2017
On low compelxity detection for QAM isomorphic constellations
Kayhan, Farbod mailto
Yes
International
IEEE GLOBECOM 2017
4-8 December
Singapore
Singapore
[en] Despite of the known gap from the Shannon's capacity, several standards are still employing QAM or star shape constellations, mainly due to the existing low complexity detectors. In this paper, we investigate the low complexity detection for a family of QAM isomorphic constellations. These constellations are known to perform very close to the peak-power limited capacity, outperforming the DVB-S2X standard constellations. The proposed strategy is to first remap the received signals to the QAM constellation using the existing isomorphism and then break the log likelihood ratio computations to two one dimensional PAM constellations. Gains larger than 0.6 dB with respect to QAM can be obtained over the peak power limited channels without any increase in detection complexity. Our scheme also provides a systematic way to design constellations with low complexity one dimensional detectors. Several open problems are discussed at the end of the paper.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/33280
FnR ; FNR11332341 > Farbod Kayhan > ESSTIMS > Enhanced Signal Space Optimization For Satellite Communication Systems > 01/02/2017 > 31/01/2020 > 2016

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
PID1201570.pdfPublisher postprint676.24 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.