Guessing Random Additive Noise Decoding (GRAND) is a recently proposed universal decoding algorithm for linear error correcting codes. Since GRAND does not depend on the structure of the code, it can be used for any code encountered in contemporary communication standards or may even be used for random linear network coding. This property makes this new algorithm particularly appealing. Instead of trying to decode the received vector, GRAND attempts to identify the noise that corrupted the codeword. To that end, GRAND relies on the generation of test error patterns that are successively applied to the received vector. In this paper, we propose the first hardware architecture for the GRAND algorithm. Considering GRAND with ABandonment (GRANDAB) that limits the number of test patterns, the proposed architecture only needs $2+\sum_{i=2}^{n} \left\lfloor\frac{i}{2}\right\rfloor$ time steps to perform the $\sum_{i=1}^3 \binom{n}{i}$ queries required when $\text{AB}=3$. For a code length of $128$, our proposed hardware architecture demonstrates only a fraction ($1.2\%$) of the total number of performed queries as time steps. Synthesis result using TSMC 65nm CMOS technology shows that average throughputs of $32$ Gbps to $64$ Gbps can be achieved at an SNR of $10$ dB for a code length of $128$ and code rates rate higher than $0.75$, transmitted over an AWGN channel. Comparisons with a decoder tailored for a $(79,64)$ BCH code show that the proposed architecture can achieve a slightly higher average throughput at high SNRs, while obtaining the same decoding performance.
Reduced-Complexity Column-Layered Decoding and Implementation for LDPC Codes
分层译码是低密度奇偶校验(LDPC)译码器实现中的一种有效方法,它能以较低的计算复杂度获得较高的译码吞吐量。这项工作,第一次,解决了低复杂度的列分层解码方案和多Gb/s应用的VLSI架构。首先,将最小和算法引入到列分层解码中。然后探索算法变换和明智的近似以最大限度地降低总体计算复杂度。与原有的列分层译码相比,新方法在保持分层译码快速收敛速度的同时,可将高速LDPC码校验节点处理的计算复杂度降低90%以上。此外,一个宽松的流水线计划,使非常高的时钟速度的VLSI实现。利用这些新技术,本文设计了一种高效的准循环LDPC码译码器结构,并采用0.13 μ m CMOS工艺实现。结果表明,对于(4096,3584)LDPC码,最多迭代10次,译码吞吐量接近4Gb/s。因此,这项工作促进了列分层解码的实际应用,特别是使其在高速,高速率LDPC解码器的实现非常有吸引力。