pith. sign in

arxiv: 1302.5910 · v4 · pith:H6E4VYHFnew · submitted 2013-02-24 · 💻 cs.IT · math.IT

Polar Lattices: Where Ar{i}kan Meets Forney

classification 💻 cs.IT math.IT
keywords polarlatticesconstructioncodeforneylevelperformanceadditive
0
0 comments X
read the original abstract

In this paper, we propose the explicit construction of a new class of lattices based on polar codes, which are provably good for the additive white Gaussian noise (AWGN) channel. We follow the multilevel construction of Forney \textit{et al.} (i.e., Construction D), where the code on each level is a capacity-achieving polar code for that level. The proposed polar lattices are efficiently decodable by using multistage decoding. Computable performance bounds are derived to measure the gap to the generalized capacity at given error probability. A design example is presented to demonstrate the performance of polar lattices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.