Low-Latency Successive-Cancellation Polar Decoder Architectures Using 2-Bit Decoding (2014)


Polar codes have emerged as important error correction codes due to their capacity-achieving property. Successive cancellation (SC) algorithm is viewed as a good candidate for hardware design of polar decoders due to its low complexity. However, for (n, k) polar codes, the long latency of SC algorithm of (2n-2) is a bottleneck for designing high-throughput polar decoder. In this paper, we present a novel reformulation for the last stage of SC decoding. The proposed reformulation leads to two benefits. First, critical path and hardware complexity in the last stage of SC algorithm is significantly reduced. Second, 2 bits can be decoded simultaneously instead of 1 bit. As a result, this new decoder, referred to as 2b-SC decoder, reduces latency from (2n-2) to (1.5n-2) without performance loss. Additionally, overlapped-scheduling, precomputation and look-ahead techniques are used to design two additional decoders referred to as 2b-SC-Overlapped-scheduling decoder and 2b-SC-Precomputation decoder, respectively. All three architectures offer significant advantages with respect to throughput and hardware efficiency. Compared to known prior least-latency SC decoder, the 2b-SC-Precomputation decoder has 25% less latency. Synthesis results show that the proposed (1024, 512) 2b-SC-Precomputation decoder can achieve at least 4 times increase in throughput and 40% increase in hardware efficiency.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Reliable Low-Latency Viterbi Algorithm Architectures Benchmarked on ASIC and FPGA - 2017ABSTRACT:The Viterbi algorithm is usually applied to a number of sensitive usage models together with decoding convolutional
PROJECT TITLE :High-Speed and Low-Latency ECC Processor Implementation Over GF(2m) on FPGA - 2017ABSTRACT:During this paper, a novel high-speed elliptic curve cryptography (ECC) processor implementation for point multiplication
PROJECT TITLE :Low-Latency, Low-Area, and Scalable Systolic-Like Modular Multipliers for GF(2m) Based on Irreducible All-One Polynomials - 2017ABSTRACT:In this paper, an efficient recursive formulation is advised for systolic
PROJECT TITLE :Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement (2014)ABSTRACT :Montgomery modular multiplication is widely used in public-key cryptosystems. This work
PROJECT TITLE :Low-Complexity Low-Latency Architecture for Matching of Data Encoded With Hard Systematic Error-Correcting Codes (2014)ABSTRACT :A new architecture for matching the data protected with an error-correcting code (ECC)

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry