An Optimised GRAND Based on Cyclic Codebook

Abstract

The cyclic codebook-GRAND (CC-GRAND) algorithm was proposed to address the issue of significant increases in storage capacity with code length in the GRAND algorithm, which uses a cyclic generation codebook to reduce codebook capacity. The simulation results show that the algorithm achieves the same bit error rate (BER) performance as the maximum likelihood decoding algorithm, while effectively reducing the codebook capacity.