Multi-Code Multi-Rate Universal Maximum Likelihood Decoder using GRAND
Authors:
- 13 September 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 239-246
Abstract
We present the first fully-integrated universal Maximum Likelihood decoder in 40 nm CMOS using the Guessing Random Additive Noise Decoding (GRAND) algorithm for low-power applications. The 0.83 mm 2 multi-code multi-rate universal decoder can efficiently decode any code of length up to 128 bits with 1 µs latency at 68 MHz. Dynamic clock gating leveraging noise statistics reduces the average power dissipation to 3.75 mW at 1.1 V or 30.6 pJ/decoded bit with a throughput of 122.6 Mb/s. Universal decoding reduces hardware footprint, and the design allows seamless swapping between codebooks with no downtime, enabling use by multiple applications without switch-over.Keywords
This publication has 21 references indexed in Scilit:
- LLR-Based Successive Cancellation List Decoding of Polar CodesIEEE Transactions on Signal Processing, 2015
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- Hardware implementation of a Reed-Solomon soft decoder based on information set decoding2014
- High-Throughput and Low-Complexity BCH Decoding Architecture for Solid-State DrivesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2013
- CRC-Aided Decoding of Polar CodesIEEE Communications Letters, 2012
- A 26.9 K 314.5 Mb/s Soft (32400,32208) BCH Decoder Chip for DVB-S2 SystemIEEE Journal of Solid-State Circuits, 2010
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- On a class of error correcting binary group codesInformation and Control, 1960
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954