On the Symmetry of Polar Codes for Symmetric Binary-Input Discrete Memoryless Channels
نویسندگان
چکیده
In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we present a new frame of analysis on the symmetry of polar codes for B-DMC channels. Theorems are provided to characterize the symmetries among the received vectors. With this new perspective, we can fully utilize the property of the underlying channels and reduce the number of equivalence classes. The analysis is applied to binary symmetric channels and shows a great reduction of the number of equivalence classes compared with the original symmetry setting.
منابع مشابه
Capacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملEmpirical and Strong Coordination via Soft Covering with Polar Codes
We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequences of actio...
متن کاملInvariance Properties of Binary Linear Block Codes over a Memoryless Channels with Discrete Input
This work studies certain properties of the Probability Density Function ( ) of the bit Log-Likelihood-Ratio ( ) for binary linear block codes over a memoryless channel with discrete input and discrete or continuous output. We prove that under a set of mild conditions on the channel, the of the bit of a specific bit position is independent of the transmitted code-word. It is also shown that the...
متن کاملA Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels
A generalization of Arıkan’s polar code construction using transformations of the form G where G is an l × l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is shown that a large class of such transformations polarize symmetric binary-input memoryless channels.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1504.04934 شماره
صفحات -
تاریخ انتشار 2015