Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

High-Throughput VLSI architecture for Soft-Decision decoding with ORBGRAND (2105.07115v1)

Published 15 May 2021 in cs.IT, cs.AR, and math.IT

Abstract: Guessing Random Additive Noise Decoding (GRAND) is a recently proposed approximate Maximum Likelihood (ML) decoding technique that can decode any linear error-correcting block code. Ordered Reliability Bits GRAND (ORBGRAND) is a powerful variant of GRAND, which outperforms the original GRAND technique by generating error patterns in a specific order. Moreover, their simplicity at the algorithm level renders GRAND family a desirable candidate for applications that demand very high throughput. This work reports the first-ever hardware architecture for ORBGRAND, which achieves an average throughput of up to $42.5$ Gbps for a code length of $128$ at an SNR of $10$ dB. Moreover, the proposed hardware can be used to decode any code provided the length and rate constraints. Compared to the state-of-the-art fast dynamic successive cancellation flip decoder (Fast-DSCF) using a 5G polar $(128,105)$ code, the proposed VLSI implementation has $49\times$ more average throughput while maintaining similar decoding performance.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Syed Mohsin Abbas (10 papers)
  2. Thibaud Tonnellier (12 papers)
  3. Furkan Ercan (14 papers)
  4. Marwan Jalaleddine (6 papers)
  5. Warren J. Gross (75 papers)
Citations (17)

Summary

We haven't generated a summary for this paper yet.