Iterative Guessing Random Additive Noise Decoder for Universal Decoding of Product Codes
- 26 May 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (12) , 8067-8080
Abstract
A fully integrated hardware design of the universal maximum likelihood Guessing Random Additive Noise Decoding (GRAND) algorithm implemented in 40 nm CMOS is presented. It is shown how this integrated hard-detection decoder, which is designed to process component codes of up to 128 bits in length, can be extended to efficiently decode product codes as long as 16,384 bits using the Iterative GRAND (IGRAND) algorithm. Pipelined stages provide throughput gain and dynamic energy savings when channel noise conditions improve. The chip allows for decoding product codes with two distinct component codes due to its ability to interleave between two codebooks without any switch-over time. Measurements demonstrate the decoder’s accuracy and efficiency in decoding a broad selection of product codes, including the capacity-achieving random linear product codes. The chip consumes an average energy of 30.6 pJ/b with a latency of 1.04 μs when decoding the BCH(127,106,7) component code at 68 MHz from 1.1 V at a bit flip probability of 10-5. Using a single chip to decode a BCH(127,106,7)2 product code which results in 16,129-bit code of rate 0.68, we demonstrate an average energy consumption of 61.2 pJ/b with an average latency of 265 μs for the same operating conditions.Keywords
Funding Information
- Battelle Grant Low-Probability-of-Detect/Intercept Communications Employing Peaky Frequency-Shift-Key Modulation (PO US0011-0000743557)
- Science Foundation Ireland (18/CRT/6049)
- Defense Advanced Research Projects Agency (HR00112120008)
- National Science Foundation Division of Electrical, Communications and Cyber Systems (2128517, 2128555)
This publication has 39 references indexed in Scilit:
- Turbo product decoding of cubic tensor codes2025
- A GRANDAB Decoder with 8.48 Gbps Worst-Case Throughput in 65nm CMOS2024
- IGRAND: decode any product code2021
- Multi-Code Multi-Rate Universal Maximum Likelihood Decoder using GRAND2021
- 5G NR CA-Polar Maximum Likelihood Decoding by GRAND2020
- Error Correction Coding2005
- Cyclic redundancy code (CRC) polynomial selection for embedded networks2004
- Near optimum decoding of product codes2002
- Near-optimum decoding of product codes: block turbo codesIEEE Transactions on Communications, 1998
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948