English

Construction D$^\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes

Information Theory 2018-10-05 v1 math.IT

Abstract

Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D^\prime lattices. Using their algorithm, we propose a Construction D^\prime lattice based on binary quasi-cyclic low-density parity-check (QC-LPDC) codes and single parity-check product codes. The underlying codes designed by the balanced-distances rule contribute in a balanced manner to the squared minimum distance of the constructed lattice, which results in a high lattice coding gain. The proposed lattice based on IEEE 802.16e QC-LDPC codes is shown to provide competitive error-rate performance on the power-unconstrained additive white Gaussian noise channel.

Keywords

Cite

@article{arxiv.1810.02163,
  title  = {Construction D$^\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes},
  author = {Siyu Chen and Brian M. Kurkoski and Eirik Rosnes},
  journal= {arXiv preprint arXiv:1810.02163},
  year   = {2018}
}

Comments

5 pages, 2 figures, to be presented in part at the 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC'18), Hong Kong, P. R. China, December 2018

R2 v1 2026-06-23T04:28:21.042Z