By their capacity achieving property, Polar codes have emerged as the most prevailing error correcting codes. Successive Cancellation (SC) Decoding follows a greedy search algorithm that decodes each bit successively thereby increasing the latency of the decoding process which is the major bottleneck of the decoding in polar codes and this leads to the necessity of designing a low latency Successive Cancellation decoder. In this paper, a stage merged decoder along with the pre-computation technique is proposed which reduces the overall latency of the decoder by more than 72% compared to some of the existing decoders and by 82% with the conventional Successive Cancellation decoder.
CITATION STYLE
Manasa, S. L., & Lakshmi Narayanan, G. (2019). A Latency and Throughput Efficient Successive Cancellation Decoding of Polar Codes. In Communications in Computer and Information Science (Vol. 1066, pp. 741–748). Springer. https://doi.org/10.1007/978-981-32-9767-8_61
Mendeley helps you to discover research relevant for your work.