Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions
arXiv:1904.11721 · doi:10.1109/ISIT.2019.8849487
Abstract
Polar transforms are central operations in the study of polar codes. This paper examines polar transforms for non-stationary memoryless sources on possibly infinite source alphabets. This is the first attempt of source polarization analysis over infinite alphabets. The source alphabet is defined to be a Polish group, and we handle the Arıkan-style two-by-two polar transform based on the group. Defining erasure distributions based on the normal subgroup structure, we give recursive formulas of the polar transform for our proposed erasure distributions. As a result, the recursive formulas lead to concrete examples of multilevel source polarization with countably infinite levels when the group is locally cyclic. We derive this result via elementary techniques in lattice theory.
arXiv comment12 pages, 1 figure, a short version has been accepted by the 2019 IEEE International Symposium on Information Theory (ISIT2019)
References in corpus (12)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- Source Polarization
- Sumset and inverse sumset theorems for Shannon entropy
- Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information
- Entropy bounds on abelian groups and the Ruzsa divergence
- Entropy and set cardinality inequalities for partition-determined functions
- Ergodic Theory Meets Polarization. I: An Ergodic Theory for Binary Operations
- Ergodic Theory Meets Polarization. II: A Foundation of Polarization Theory
- Entropies of weighted sums in cyclic groups and an application to polar codes
- Fourier Analysis of MAC Polarization
- A Generalized Erasure Channel in the Sense of Polarization for Binary Erasure Channels
- Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels