English

Construction D' Lattices for Power-Constrained Communications

Information Theory 2022-01-03 v2 math.IT

Abstract

Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be used with shaping lattices for power-constrained channels are given. We construct nested lattice codes with good coding properties, a high shaping gain, and low-complexity encoding and decoding. Convolutional code generator polynomials for Construction A lattices with the greatest shaping gain are given, as a result of an extensive search. It is shown that rate 1/3 convolutional codes provide a more favorable performance-complexity trade-off than rate 1/2 convolutional codes. Tail-biting convolutional codes have higher shaping gain than that of zero-tailed convolutional codes. A design for quasi-cyclic low-density parity-check (QC-LDPC) codes to form Construction D' lattices which have efficient encoding and indexing is presented. The resulting QC-LDPC Construction D' lattices are evaluated using four shaping lattices: the E8E_8 lattice, the BW16BW_{16} lattice, the Leech lattice and our best-found convolutional code lattice, showing a shaping gain of approximately 0.65 dB, 0.86 dB, 1.03 dB and 1.25 dB at dimension 2304.

Keywords

Cite

@article{arxiv.2103.08263,
  title  = {Construction D' Lattices for Power-Constrained Communications},
  author = {Fan Zhou and Brian M. Kurkoski},
  journal= {arXiv preprint arXiv:2103.08263},
  year   = {2022}
}

Comments

13 pages, 6 figures, submitted to IEEE Transactions on Communications

R2 v1 2026-06-24T00:09:39.624Z