Successive cancellation decoding

2020 IEEE International Symposium on Information Theory (ISIT), 2020
Successive-cancellation decoding has gained much renewed interest since the advent of polar coding a decade ago. For polar codes, successive-cancellation decoding can be accomplished in time O(n log n). However, the complexity of successive-cancellation decoding for other families of codes remains largely unexplored.
Arman Fazeli, Alexander Vardy
exaly +2 more sources

Block successive cancellation decoding of polarization-based codes

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016
Linear codes constructed using a polarization transformation followed by short blocklength sub-codes are proposed. Decoding is realized by the successive cancellation algorithm combined with standard optimal or non-optimal decoding of the sub-codes. List successive cancellation decoding can also be used.
Dina Goldin, David Burshtein
exaly +2 more sources

Interleaved successive cancellation polar decoders

2014 IEEE International Symposium on Circuits and Systems (ISCAS), 2014
Polar codes are among the most promising error correction codes due to their ability to achieve the symmetric capacities of the binary-input discrete memoryless channels (B-DMCs). However, how to design successive cancellation (SC) decoders which can maximize the hardware utilization efficiency is still challenging due to the inherent serial nature of ...
Chuan Zhang 0001, Keshab K. Parhi
openaire +1 more source

polar codes
fos: computer and information sciences
information theory cs.it

computer science - information theory
polar code
computer science - hardware architecture

hardware architecture cs.ar
successive cancellation list
successive cancellation list decoding