Hardware Architecture for List Successive Cancellation Decoding of Polar Codes
Reads0
Chats0
TLDR
This brief presents a hardware architecture and algorithmic improvements for list successive cancellation (SC) decoding of polar codes and shows how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding.Abstract:
This brief presents a hardware architecture and algorithmic improvements for list successive cancellation (SC) decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding. The hardware architecture was synthesized for a blocklength of N = 1024 bits and list sizes L = 2, 4 using a UMC 90 nm VLSI technology. The resulting decoder can achieve a coded throughput of 181 Mb/s at a frequency of 459 MHz.read more
Citations
More filters
Journal ArticleDOI
LLR-Based Successive Cancellation List Decoding of Polar Codes
TL;DR: 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.
Journal ArticleDOI
Design of Polar Codes in 5G New Radio
TL;DR: The struggles of designing a family of polar codes able to satisfy the demands of 5G systems are illustrated, with particular attention to rate flexibility and low decoding latency.
Journal ArticleDOI
Fast List Decoders for Polar Codes
TL;DR: This paper presents a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software and shows that for software-defined radio applications, the proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature.
Journal ArticleDOI
Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
TL;DR: In this paper, the authors improved SSCL and SSCL-SPC by proving that the list size imposes a specific number of path splitting required to decode rate one and single parity check codes, while guaranteeing exactly the same error-correct performance as if the paths were forked at each bit estimation.
Journal ArticleDOI
A Fast Polar Code List Decoder Architecture Based on Sphere Decoding
TL;DR: A speed-up technique for successive-cancellation list decoding of polar codes that is exact for list size of 2, while its approximations bring negligible error-correction performance degradation (<;0.05 dB) for other list sizes.
References
More filters
Journal ArticleDOI
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
TL;DR: The paper proves that, given any B-DMC W with I(W) > 0 and any target rate R< I( W) there exists a sequence of polar codes {Cfrn;nges1} such that Cfrn has block-length N=2n, rate ges R, and probability of block error under successive cancellation decoding bounded as Pe(N,R) les O(N-1/4) independently of the code rate.
Proceedings ArticleDOI
List decoding of polar codes
Ido Tal,Alexander Vardy +1 more
TL;DR: 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.
Journal ArticleDOI
A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
TL;DR: 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.
Proceedings ArticleDOI
Hardware architectures for successive cancellation decoding of polar codes
TL;DR: It is shown that successive cancellation decoding can be implemented in the logarithmic domain, thereby eliminating the multiplication and division operations and greatly reducing the complexity of each processing element.
Journal ArticleDOI
Improved Successive Cancellation Decoding of Polar Codes
TL;DR: Unified descriptions of the SC, SCL, and SCS decoding algorithms are given as path search procedures on the code tree of polar codes and a new decoding algorithm called the successive cancellation hybrid (SCH) is proposed to provide a flexible configuration when the time and space complexities are limited.