移动通信2024，Vol.48Issue(5)：49-54,6.DOI:10.3969/j.issn.1006-1010.20240427-0001
线性分组码的G RAN D算法研究
Research on GRAND Algorithm for Linear Block Codes
摘要
Abstract
With the development and application of 5G communication technology,the short packet channel coding and decoding technology in high-reliability and low-latency communication scenarios has received widespread attention.Guessing Random Additive Noise Decoding(GRAND)is a universal maximum likelihood decoding algorithm.Unlike traditional decoding algorithms,the GRAND algorithm determines the transmitted codeword through noise guessing and codebook querying,and it has an efficient hardware implementation structure.This article introduces the basic principles of GRAND and its improved algorithms,analyzes the bit error rate performance of different GRAND algorithms through simulation,and provides design solutions for GRAND algorithm in 5G NR short-length Low-density Parity-Check(LDPC)code and Polarized Adjusted Convolutional(PAC)code,serving as a reference for future short code design in mobile communications.关键词
短码/GRAND算法/线性分组码Key words
short codes/GRAND decoding/linear block codes分类
信息技术与安全科学引用本文复制引用
史治平,杨娟,李坤阳,王玥..线性分组码的G RAN D算法研究[J].移动通信,2024,48(5):49-54,6.基金项目
国家自然科学基金面上项目"短码通用译码算法GRAND及其应用研究"(62371101) （62371101）
