Revisit the AWGN-goodness of Polar-like Lattices
Ling Liu, Junjiang Yu, Shanxiang Lyu, Baoming Bai
TL;DR
This work studies polar lattices and PAC lattices from a generator-matrix viewpoint and proves AWGN-goodness for the polar and PAC lattice families under multilevel decoding. It shows how to construct polar lattices via lifting and row scaling of the polar code generator and analyzes their volume and decoding complexity, establishing conditions (r = O(log N), C(Z, σ^2) → 0) under which the normalized volume-to-noise ratio converges to the AWGN limit. The PAC lattice framework is then tied to polar lattices through bar{G}_{pac} = bar{T} × bar{G}, explaining distance and decoding advantages, and highlighting a gluing-theory interpretation of the design. Overall, the paper provides a constructive, scalable approach to achieving AWGN-optimal performance with polar-like lattices and offers design principles to further enhance practical performance via PAC structures and multiplier matrices T.
Abstract
This paper aims to provide a comprehensive introduction to lattices constructed based on polar-like codes and demonstrate some of their key properties, such as AWGN goodness. We first present polar lattices directly from the perspective of their generator matrix. Next, we discuss their connection with the recently proposed PAC (polarization adjusted convolutional) lattices and analyze the structural advantages of PAC lattices, through which the AWGN-goodness of PAC lattices can be conveniently demonstrated.
