Complexity Reduction with High Throughput M-Parallel Successive Cancellation Decoding

Abstract

According to the strategy of SC decoding where its performance is limited by the bit by bit decoding, correcting the bit that wrongly determined in the future decoding procedure becomes impossible. In this paper we proposed a new technique to correct wrongly determined bits in direct through decoding operations; the error propagation can also be directly corrected. The enhanced version of successive cancellation decoding is proposed to improve its performance for any code-length. This technique called multi-parallel SCD can provide a significant complexity reduction by avoiding unnecessary path searching operations. Furthermore, only undetectable bits (lost bits) over successive cancellation decoder are taken into consideration for path searching operations. The proposed algorithm that is applied into each decoder arranged directly over M-parallel SCD through processing operation by taking both possibilities in decision of wrongly determined bits (zero or one) . Multi-parallel SCD technique is a self-correcting path searching track that illustrate a significant decoding performance with low complexity over Binary Erasure Channel (BEC).