Construction D$^\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2018
- DOI:
- 10.48550/arXiv.1810.02163
- arXiv:
- arXiv:1810.02163
- Bibcode:
- 2018arXiv181002163C
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- 5 pages, 2 figures, to be presented in part at the 10th International Symposium on Turbo Codes &