Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions

04/26/2019
by   Yuta Sakai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2018

Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization

This study proposes a novel channel model called the modular arithmetic ...
research
09/06/2022

ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits

ABS polar codes were recently proposed to speed up polarization by swapp...
research
04/18/2019

Non-Stationary Polar Codes for Resistive Memories

Resistive memories are considered a promising memory technology enabling...
research
01/29/2019

Non Binary Polar Codes with Equidistant Transform for Transmission over the AWGN Channel

Finding fast polarizing transforms is an important problem as polar code...
research
02/15/2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes

We present a deterministic algorithm for computing the entire weight dis...
research
12/09/2019

Resolving Conflicts and Electing Leaders

We review distributed algorithms for transmitting data (n real numbers) ...

Please sign up or login with your details

Forgot password? Click here to reset