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.
翻译:Voronoi星座(VCs)是由被翻译的Voronoi成形的拉蒂(latice)区域(Lattice)的Voronoi 区域所附加的编码的有限矢量。在常规VCs中,成形的拉蒂(latice)是编码的拉蒂(VCs)的缩放版。在本文中,我们设计了低兼容性VCs,其编码的立方维度为32维特,其中使用伪伽标签来尽量减少比特误差率。所设计的VCs具有相当可观的增益,最高达1.03 dB,并且对实际中的光谱效率作了更细的选择。根据极大型星座的重要性取样,提出了一种相互的信息估计方法和对日志相似的近似方法,并将其应用于设计中的VCs。在错误控制编码中,拟议的VCs的可实现信息率可能高于常规缩放的VCs,因为它们本身具有良好的伪色标签特性,其解码复杂性较低。