Polar lattices: Where Arıkan meets Forney
Yanfei Yan, Cong Ling, Xiaofu Wu
Abstract
Yanfei Yan, Cong Ling, Xiaofu Wu
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 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. 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.
OpenAlex reports 49 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 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. 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.
Key concepts: Polar code, Polar, Additive white Gaussian noise, Decoding methods, Code (set theory), Computer science, Measure (data warehouse), Algorithm