Construction D^′ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes

2018/10/04 by Chen, Siyu, Kurkoski, Brian M., Rosnes, Eirik
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1810.02163

Abstract

Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D^′ lattices. Using their algorithm, we propose a Construction D^′ 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.

Related

• Construction D' Lattices for Power-Constrained Communications
• Practical Encoder and Decoder for Power Constrained QC-LDPC lattices
• Capacity Achieving Low Density Parity Check Lattices
• LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
• Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding