Designing Voronoi Constellations to Minimize Bit Error Rate
Paper i proceeding, 2021

In a classical 1983 paper, Conway and Sloane presented fast encoding and decoding algorithms for a special case of Voronoi constellations (VCs), for which the shaping lattice is a scaled copy of the coding lattice. Feng generalized their encoding and decoding methods to arbitrary VCs. Less general algorithms were also proposed by Kurkoski and Ferdinand, respectively, for VCs with some constraints on their coding and shaping lattices. In this work, we design VCs with a cubic coding lattice based on Kurkoski's encoding and decoding algorithms. The designed VCs achieve up to 1.03 dB shaping gains with a lower complexity than Conway and Sloane's scaled VCs. To minimize the bit error rate (BER), pseudo-Gray labeling of constellation points is applied. In uncoded systems, the designed VCs reduce the required SNR by up to 1.1 dB at the same BER, compared with the same VCs using Feng's and Ferdinand's algorithms. In coded systems, the designed VCs are able to achieve lower BER than the scaled VCs at the same SNR. In addition, a Gray penalty estimation method for such VCs of very large size is introduced.

Författare

Shen Li

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Ali Mirani

Chalmers, Mikroteknologi och nanovetenskap (MC2), Fotonik

Magnus Karlsson

Chalmers, Mikroteknologi och nanovetenskap (MC2), Fotonik

Erik Agrell

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

Vol. 2021-July 1017-1022

2021 IEEE International Symposium on Information Theory, ISIT 2021
Virtual, Melbourne, Australia,

Signalformning i optisk datatransmission – bortom gausskanalen

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

Ämneskategorier

Telekommunikation

Reglerteknik

Signalbehandling

DOI

10.1109/ISIT45174.2021.9517815

Mer information

Senast uppdaterat

2021-09-28