On the Design of Multi-Dimensional Irregular Repeat-Accumulate Lattice Codes
Min Qiu, Lei Yang, Yixuan Xie, Jinhong Yuan

TL;DR
This paper introduces a novel method for designing multi-dimensional lattice codes using non-binary IRA codes, enabling efficient decoding and near-Shannon-limit performance by leveraging permutation-invariance and Gaussian approximation.
Contribution
It proposes a new encoding structure for multi-dimensional IRA lattice codes that ensures symmetry and permutation-invariance, facilitating analysis and optimization.
Findings
Codes approach Shannon limit within 0.46 dB
Outperform existing lattice coding schemes
Enable Gaussian approximation for iterative decoding
Abstract
Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions directly from non-binary linear codes over finite fields. In this paper, we design lattice codes from Construction A lattices where the underlying linear codes are non-binary irregular repeat-accumulate (IRA) codes. Most importantly, our codes are based on multi-dimensional lattice partitions with finite constellations. We propose a novel encoding structure that adds randomly generated lattice sequences to the encoder's messages, instead of multiplying lattice sequences to the encoder's messages. We prove that our approach can ensure that the decoder's messages exhibit permutation-invariance and symmetry properties. With these two properties, the densities…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Error Correcting Code Techniques · Wireless Communication Security Techniques
