Low Complexity ML-Detection of Arbitrary Spherical Codes

Conference: SCC 2017 - 11th International ITG Conference on Systems, Communications and Coding
02/06/2017 - 02/09/2017 at Hamburg, Germany

Proceedings: ITG-Fb. 268: SCC 2017

Pages: 5Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Rachinger, Christoph; Mueller, Ralf R.; Huber, Johannes B. (Friedrich-Alexander-University Erlangen-Nürnberg, Germany)

Abstract:
We present two algorithms that quantize arbitrary points to a given constellation efficiently, even though there may not be an analytic description of this constellation. We choose spherical codes as constellations, because the best spherical codes can often only be computed numerically. The quantization is equivalent to a maximum likelihood-detection, but the average number of operations can be greatly reduced. The comparison between our proposed algorithms and a brute force approach is done by numerical simulations.