Low-Complexity Voronoi Shaping for the Gaussian Channel
Artikel i vetenskaplig tidskrift, 2022

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 compared with conventional VCs. 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 information rates than the conventional scaled VCs because of their inherently good pseudo-Gray labeling feature, with a lower decoding complexity.

Lattices

Geometric shaping

Encoding

information rates

Spectral efficiency

Constellation diagram

Voronoi constellation

Decoding

multidimensional modulation formats

Generators

lattices

Gain

Författare

Shen Li

Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk

Ali Mirani

Chalmers, Mikroteknologi och nanovetenskap, Fotonik

Magnus Karlsson

Chalmers, Mikroteknologi och nanovetenskap, Fotonik

Erik Agrell

Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk

IEEE Transactions on Communications

00906778 (ISSN) 15580857 (eISSN)

Vol. 70 2 865-873

Signalformning i optisk datatransmission – bortom gausskanalen

Vetenskapsrådet (VR) (2017-03702), 2018-01-01 -- 2021-12-31.

Frigöra full fiberoptisk kapacitet

Knut och Alice Wallenbergs Stiftelse (KAW 2018.0090), 2019-07-01 -- 2024-06-30.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier (SSIF 2011)

Telekommunikation

Signalbehandling

DOI

10.1109/TCOMM.2021.3130286

Mer information

Senast uppdaterat

2025-12-22