Partitioned successive-cancellation list decoding of polar codes

@article{Hashemi2015PartitionedSL,
  title={Partitioned successive-cancellation list decoding of polar codes},
  author={Seyyed Ali Hashemi and Alexios Balatsoukas-Stimming and Pascal Giard and Claude Thibeault and Warren J. Gross},
  journal={2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
  year={2015},
  pages={957-960}
}
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional SCL algorithm. The decoder tree is broken into partitions that are decoded separately. We show that with careful selection of list sizes and… 

Figures and Tables from this paper

Partitioned Successive-Cancellation Flip Decoding of Polar Codes

The partitioned SC- Flip (PSCF) decoding algorithm is proposed, which outperforms SC-Flip in terms of error-correction performance and average computational complexity, leading to higher throughput and reduced energy consumption per codeword.

Stepped List Decoding for Polar Codes

  • M. RowshanE. Viterbo
  • Computer Science
    2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
  • 2018
This paper investigates the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process, and advocates that the list size can change stepwise depending on PMR.

List Estimation-aided Successive-Cancellation List Decoding of Polar Codes

  • Hongxu JinRongke Liu
  • Computer Science, Business
    2018 IEEE/CIC International Conference on Communications in China (ICCC)
  • 2018
Based on the reliability degree of the codeword decoded by the successive-cancellation (SC) decoding, a list estimation method has been proposed for a poor case of channel environments, where the log-likelihood ratio (LLR) from SC decoding output is utilized to estimate a list size.

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance

By changing the construction of the code, the paradigm of PSCL decoding is examined from both theoretical and practical standpoints, and an optimal scheme to allocate cyclic redundancy checks (CRCs) is presented and an upper bound on the list size that allows MAP performance is provided.

Minimum-effort successive cancellation list decoding of polar codes

This work proposes minimum-effort SCL (ME-SCL) decoding, that allows to determine the parallelism to adopt by performing simple observations on the input of the decoder, and can be combined with existing complexity- and power- reduction techniques.

Improved Adaptive Successive Cancellation List Decoding of Polar Codes

A simplified adaptive successive cancellation list (SAD-SCL) is proposed that has lower computational complexity than AD-S CL and SCAD- sCL with negligible loss of performance and its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD- SCL algorithm.

Reduced Path Successive Cancellation List Decoding for Polar Codes

A reduced path successive cancellation list (RP-SCL) decoder is presented to reduce this complexity, where some decoding paths are pruned, and the computational complexity and the memory requirements decrease.

Reduced Path Successive Cancellation List Decoding for Polar Codes

A reduced path successive cancellation list (RP-SCL) decoder is presented to reduce this complexity, where some decoding paths are pruned, and the computational complexity and the memory requirements decrease.

Segmented Successive Cancellation List Polar Decoding with Tailored CRC

The tailored CRC-aided SCL (TCA-SCL) decoding is proposed to balance performance and complexity and analysis on how to choose the proper CRC for a given segment is proposed with the help of virtual transform and virtual length.

Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes

A fresh look is taken at the SCD algorithm and two decoding algorithms are proposed a) successive cancellation with back-tracking (SC-BT) and successive cancelling with look ahead ( SC-LA), which try to improve the performance using a memory of size O(N).

References

SHOWING 1-10 OF 14 REFERENCES

A low-complexity improved successive cancellation decoder for polar codes

A new flavor of the SC decoder is described, called the SC flip decoder, which preserves the low memory requirements of the basic SC decoding and adjusts the required decoding effort to the signal quality.

Partitioned Successive-Cancellation Flip Decoding of Polar Codes

The partitioned SC- Flip (PSCF) decoding algorithm is proposed, which outperforms SC-Flip in terms of error-correction performance and average computational complexity, leading to higher throughput and reduced energy consumption per codeword.

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance

By changing the construction of the code, the paradigm of PSCL decoding is examined from both theoretical and practical standpoints, and an optimal scheme to allocate cyclic redundancy checks (CRCs) is presented and an upper bound on the list size that allows MAP performance is provided.

LLR-based successive cancellation list decoding of polar codes

The LLR-based formulation of the successive cancellation list (SCL) decoder is presented, which leads to a more efficient hardware implementation of the decoder compared to the known log-likelihood based implementation.

A Semi-Parallel Successive-Cancellation Decoder for Polar Codes

The derived architecture has a very low processing complexity while the memory complexity remains similar to that of previous architectures, which allows very large polar code decoders to be implemented in hardware.

List decoding of polar codes

  • I. TalA. Vardy
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
It appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes, and devise an efficient, numerically stable, implementation taking only O(L · n log n) time and O( L · n) space.

Memory-Efficient Polar Decoders

This paper proposes a set of novel techniques that aim at reducing the high-memory cost of SC-based decoders and can be applied on top of existing memory reduction techniques.

On error-correction performance and implementation of polar code list decoders for 5G

This work evaluates SCL-based decoding algorithms in terms of error-correction performance and compare them to low-density parity-check (LDPC) codes, and shows that among Scl-based decoders, the partitioned SCL (PSCL) provides the lowest area occupation and power consumption, whereas fast simplified SCL(Fast-SSCL) yields the lowest energy consumption.

An Improved SCFlip Decoder for Polar Codes

It is shown that the SCFlip-2 decoder yields significant gains in terms of decoding performance and competes with the performance of the CRC-aided SC-List decoder with list size L=4, while having an average decoding complexity similar to that of the standard SC decoding, at medium to high signal to noise ratio.

Cyclic redundancy code (CRC) polynomial selection for embedded networks

A polynomial selection process for embedded network applications is described and a set of good general-purpose polynomials are proposed that provide good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.