Improved Successive Cancellation Decoding of Polar Codes
arXiv:1208.3598 · doi:10.1109/TCOMM.2013.070213.120789
Abstract
As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. Unified descriptions of SC, SCL and SCS decoding algorithms are given as path searching procedures on the code tree of polar codes. Combining the ideas of SCL and SCS, a new decoding algorithm named successive cancellation hybrid (SCH) is proposed, which can achieve a better trade-off between computational complexity and space complexity. Further, to reduce the complexity, a pruning technique is proposed to avoid unnecessary path searching operations. Performance and complexity analysis based on simulations show that, with proper configurations, all the three improved successive cancellation (ISC) decoding algorithms can have a performance very close to that of maximum-likelihood (ML) decoding with acceptable complexity. Moreover, with the help of the proposed pruning technique, the complexities of ISC decoders can be very close to that of SC decoder in the moderate and high signal-to-noise ratio (SNR) regime.
This paper is modified and submitted to IEEE Transactions on Communications
Cited by in corpus (35)
- LLR-based Successive Cancellation List Decoding of Polar Codes
- Polar Subcodes
- Finite-Length Scaling of Polar Codes
- A Split-Reduced Successive Cancellation List Decoder for Polar Codes
- A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
- Polar-Coded Non-Orthogonal Multiple Access
- Polar Codes and Their Quantum-Domain Counterparts
- Low-latency List Decoding Of Polar Codes With Double Thresholding
- A Golden Decade of Polar Codes: From Basic Principle to 5G Applications
- Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra
- Polar Coded Diversity on Block Fading Channels via Polar Spectrum
- Polar Codes: Analysis and Construction Based on Polar Spectrum
- On the Error Performance of Systematic Polar Codes
- Hardware Architecture for List SC Decoding of Polar Codes
- Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes
- Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks
- Optimized Rate-Profiling for PAC Codes
- Progressive Bit-Flipping Decoding of Polar Codes Over Layered Critical Sets
- Space-Time Polar Coded Modulation
- Towards Practical Software Stack Decoding of Polar Codes
- A Novel Interleaving Scheme for Polar Codes
- Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
- Reinforcement Learning for Nested Polar Code Construction
- Channel Estimation with Systematic Polar Codes
- An Efficient List Decoder Architecture for Polar Codes
- Sphere Constraint based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes
- ARUM: Polar Coded HARQ Scheme based on Incremental Channel Polarization
- Successive Cancellation List Polar Decoder using Log-likelihood Ratios
- Polar-Precoding: A Unitary Finite-Feedback Transmit Precoder for Polar-Coded MIMO Systems
- On the Construction of -coset Codes for Parallel Decoding
- Fast Block Sequential Decoding of Polar Codes
- Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction
- SC-Fano Decoding of Polar Codes
- A Correlation-Breaking Interleaving of Polar Codes in Concatenated Systems
- Polar Codes with Memory