Construction of Capacity-Achieving Lattice Codes: Polar Lattices

Abstract

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the multilevel approach of Forney \textit{et al.}, where we construct a capacity-achieving polar code on each level. The component polar codes are shown to be naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are \emph{AWGN-good}. Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is $O(N\log N)$ for any fixed target error probability.

full version of the paper to appear in IEEE Trans. Communications

References in corpus (6)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• An Algebraic Approach to Physical-Layer Network Coding
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• Polarization for arbitrary discrete memoryless channels
• Lattice Index Coding
• Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C

Cited by in corpus (7)

• Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
• Sparse Regression Codes
• Construction ${\pi }_A$ and ${\pi }_D$ Lattices: Construction, Goodness, and Decoding Algorithms
• Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices
• Polar Codes and Polar Lattices for the Heegard-Berger Problem
• Improving the Performance of Nested Lattice Codes Using Concatenation
• Extracting Wyner's Common Information Using Polar Codes and Polar Lattices