Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes

Abstract

A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $\epsilon >0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-\epsilon }}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-\epsilon }}$, the frame error probability of Arikan's polar codes. The proposed concatenated polar codes and Arikan's polar codes are also compared for transmission over channels with erasure bursts. We provide a sufficient condition on the length of erasure burst which guarantees failure of the polar decoder. On the other hand, it is shown that the parameters of the concatenated polar code can be set in such a way that the capacity-achieving properties of polar codes are preserved. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.

Submitted to IEEE Transactions on Communications. arXiv admin note: substantial text overlap with arXiv:1301.7491

Cited by in corpus (13)

• Deep Learning Methods for Improved Decoding of Linear Codes
• 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
• Relaxed Polar Codes
• Circular Buffer Rate-Matched Polar Codes
• Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding
• Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
• Rate-Compatible Polar Codes for Wireless Channels
• Challenges and some new directions in channel coding
• Attaining Capacity with Algebraic Geometry Codes through the $(U|U+V)$ Construction and Koetter-Vardy Soft Decoding
• FEC-Assisted Parallel Decoding of Polar Coded Frames: Design Considerations
• Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes
• A Novel High-Rate Polar-Staircase Coding Scheme