Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels
arXiv:0901.2207
Abstract
Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the original paper, the construction complexity is exponential in the blocklength. In this paper, a new construction method for arbitrary symmetric binary memoryless channel (B-MC) with linear complexity in the blocklength is proposed. Furthermore, new upper and lower bounds of the block error probability of polar codes are derived for the BEC and the arbitrary symmetric B-MC, respectively.
5 pages, 3 figures, submitted to ISIT2009; revised
Cited by in corpus (18)
- Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
- Fast Low-Complexity Decoders for Low-Rate Polar Codes
- High Performance Error Correction for Quantum Key Distribution using Polar Codes
- On the Error Performance of Systematic Polar Codes
- Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
- On the Construction of Polar Codes for Channels with Moderate Input Alphabet Sizes
- Polar Codes with Mixed-Kernels
- Spatially Coupled Codes over the Multiple Access Channel
- On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design
- Polar write once memory codes
- The Symmetric Convex Ordering: A Novel Partial Order for B-DMCs Ordering the Information Sets of Polar Codes
- Design of Polar Codes with Single and Multi-Carrier Modulation on Impulsive Noise Channels using Density Evolution
- Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
- On Puncturing Strategies for Polar Codes
- Efficient Construction of Polar Codes
- A Lower Bound on the Probability of Error of Polar Codes over BMS Channels
- Dynamic-SCFlip Decoding of Polar Codes
- Refined rate of channel polarization