Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Li, S., Mirani, A., Karlsson, M., Agrell, E.
Format: Preprint
Veröffentlicht: 2021
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2106.03262
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914649964806144
author Li, S.
Mirani, A.
Karlsson, M.
Agrell, E.
author_facet Li, S.
Mirani, A.
Karlsson, M.
Agrell, E.
contents Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up version of the coding lattice. In this paper, we design low-complexity VCs with a cubic coding lattice of up to 32 dimensions, in which pseudo-Gray labeling is applied to minimize the bit error rate. The designed VCs have considerable shaping gains of up to 1.03 dB and finer choices of spectral efficiencies in practice. A mutual information estimation method and a log-likelihood approximation method based on importance sampling for very large constellations are proposed and applied to the designed VCs. With error-control coding, the proposed VCs can have higher achievable information rates than the conventional scaled VCs because of their inherently good pseudo-Gray labeling feature, with a lower decoding complexity.
format Preprint
id arxiv_https___arxiv_org_abs_2106_03262
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Low-complexity Voronoi shaping for the Gaussian channel
Li, S.
Mirani, A.
Karlsson, M.
Agrell, E.
Information Theory
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up version of the coding lattice. In this paper, we design low-complexity VCs with a cubic coding lattice of up to 32 dimensions, in which pseudo-Gray labeling is applied to minimize the bit error rate. The designed VCs have considerable shaping gains of up to 1.03 dB and finer choices of spectral efficiencies in practice. A mutual information estimation method and a log-likelihood approximation method based on importance sampling for very large constellations are proposed and applied to the designed VCs. With error-control coding, the proposed VCs can have higher achievable information rates than the conventional scaled VCs because of their inherently good pseudo-Gray labeling feature, with a lower decoding complexity.
title Low-complexity Voronoi shaping for the Gaussian channel
topic Information Theory
url https://arxiv.org/abs/2106.03262