On the performance of 1-level LDPC lattices

2013/02/03 by Mohammad-Reza Sadeghi, Sadeghi, Mohammad-Reza, Amin Sakzad +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1302.0459

1 figure, submitted to IWCIT 2013

arxiv created 2013/02/03 · arxiv updated 2013/02/05

Abstract

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-level LDPC lattice of size 10000 can work as close as 1.1 dB at normalized error probability (NEP) of 10^-5.This can also be reported as 0.6 dB at symbol error rate (SER) of 10^-5 with sum-product algorithm.

Related

• Capacity Achieving Low Density Parity Check Lattices
• Practical Encoder and Decoder for Power Constrained QC-LDPC lattices
• Low Density Lattice Codes
• On the decoding of lattices constructed via a single parity check
• LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel