Polarization for arbitrary discrete memoryless channels
arXiv:0908.0302
Abstract
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for the binary case leads to polarization. This method can be extended to channels of composite input alphabet sizes by decomposing such channels into a set of channels with prime input alphabet sizes. It is also shown that all discrete memoryless channels can be polarized by randomized constructions. The introduction of randomness does not change the order of complexity of polar code construction, encoding, and decoding. A previous result on the error probability behavior of polar codes is also extended to the case of arbitrary discrete memoryless channels. The generalization of polarization to channels with arbitrary finite input alphabet sizes leads to polar-coding methods for approaching the true (as opposed to symmetric) channel capacity of arbitrary channels with discrete or continuous input alphabets.
12 pages
References in corpus (2)
Cited by in corpus (40)
- Efficient Quantum Polar Coding
- Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
- Construction of Capacity-Achieving Lattice Codes: Polar Lattices
- Polar codes in network quantum information theory
- Properties and Construction of Polar Codes
- Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels
- Polar Codes for the m-User MAC
- On the Error Performance of Systematic Polar Codes
- Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs
- Continuity of Channel Parameters and Operations under Various DMC Topologies
- Low Complexity Belief Propagation Polar Code Decoders
- Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
- Polar Codes with Mixed-Kernels
- Strong Coordination over Noisy Channels
- Fourier Analysis of MAC Polarization
- Optimal Non-Uniform Mapping for Probabilistic Shaping
- Polar codes for the m-user multiple access channels
- Performance of Polar Codes on wireless communications Channel
- Improved Bounds on the Finite Length Scaling of Polar Codes
- Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes
- Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels
- Expansion coding: Achieving the capacity of an AEN channel
- Fast Polarization for Processes with Memory
- Polar write once memory codes
- Universal Source Polarization and an Application to a Multi-User Problem
- On the Finite Length Scaling of Ternary Polar Codes
- Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
- A multi-mode area-efficient SCL polar decoder
- Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
- Challenges and some new directions in channel coding
- Polar coding for interference networks
- Error Performance Analysis of the Symbol-Decision SC Polar Decoder
- Concatenated LDPC-Polar Codes Decoding Through Belief Propagation
- Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes
- Hardware Implementation of Successive Cancellation Decoders for Polar Codes
- Polar Coding for the Wiretap Broadcast Channel with Multiple Messages
- MIMO Systems With Low-Resolution ADCs: Linear Coding Approach
- Capacity-Achieving Rate-Compatible Polar Codes for General Channels
- Polar Coding for Fading Channels
- Polar Coding for Fading Channels: Binary and Exponential Channel Cases