Relaxed Polar Codes
arXiv:1501.06091 · doi:10.1109/TIT.2017.2657691
Abstract
Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Arıkan's polar encoder and successive cancellation decoder have complexities of , for code length . Although, the complexity bound of is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consider schemes for relaxing the polarization of both \emph{very good} and \emph{very bad} bit-channels, in the process of channel polarization. Relaxed polar codes are proved to preserve the capacity achieving property of polar codes. Analytical bounds on the asymptotic and finite-length complexity reduction attainable by relaxed polarization are derived. For binary erasure channels, we show that the computation complexity can be reduced by a factor of 6, while preserving the rate and error performance. We also show that relaxed polar codes can be decoded with significantly reduced latency. For AWGN channels with medium code lengths, we show that relaxed polar codes can have lower error probabilities than conventional polar codes, while having reduced encoding and decoding computation complexities.
arXiv commentConference version,Relaxed Channel Polarization for Reduced Complexity Polar Coding, accepted for presentation at IEEE Wireless Communications and Networking Conference WCNC 2015
References in corpus (11)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- Fast Polar Decoders: Algorithm and Implementation
- Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
- Source Polarization
- Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes
- Polar Codes For Broadcast Channels
- Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding
- Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding
- On the scaling of Polar codes: I. The behavior of polarized channels
- Recursive constructions and their maximum likelihood decoding
- Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding
Cited by in corpus (8)
- Polar Codes' Simplicity, Random Codes' Durability
- Circular Buffer Rate-Matched Polar Codes
- Log-logarithmic Time Pruned Polar Coding
- Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
- The Fractality of Polar and Reed-Muller Codes
- Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels
- Protograph-Based Design for QC Polar Codes
- Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction