Low-complexity Voronoi shaping for the Gaussian channel
arXiv:2106.03262 · doi:10.1109/TCOMM.2021.3130286
Abstract
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.
arXiv comment10 pages, 6 figures
References in corpus (7)
- An Algebraic Approach to Physical-Layer Network Coding
- Achievable Information Rates for Fiber Optics: Applications and Computations
- Faster Projection in Sphere Decoding
- End-to-End Learning of Geometrical Shaping Maximizing Generalized Mutual Information
- Increasing Achievable Information Rates via Geometric Shaping
- Low-Complexity Geometric Shaping
- Low-complexity Voronoi shaping for the Gaussian channel