Low-complexity Voronoi shaping for the Gaussian channel

06/06/2021
by   S. Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2018

Noncoherent LDPC-Coded Physical-Layer Network Coding using Multitone FSK

A noncoherent two-way relaying system is developed using physical-layer ...
research
01/09/2018

Spatial Lattice Modulation for MIMO Systems

This paper proposes spatial lattice modulation (SLM), a spatial modulati...
research
04/20/2020

Shaping for Construction D Lattices

In this paper we propose a practical and general method for shaping a co...
research
09/09/2022

Constellations on the Sphere with Efficient Encoding-Decoding for Noncoherent Communications

In this paper, we propose a new structured Grassmannian constellation fo...
research
12/21/2017

Multilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction D'

Lattice codes are elegant and powerful structures that not only can achi...
research
02/22/2018

Faster integer multiplication using short lattice vectors

We prove that n-bit integers may be multiplied in O(n log n 4^log^* n)...
research
10/01/2021

A Unified Discretization Approach to Compute-Forward: From Discrete to Continuous Inputs

Compute-forward is a coding technique that enables receiver(s) in a netw...

Please sign up or login with your details

Forgot password? Click here to reset