|国家科技期刊平台
首页|期刊导航|移动通信|线性分组码的G RAN D算法研究

线性分组码的G RAN D算法研究OA

Research on GRAND Algorithm for Linear Block Codes

中文摘要英文摘要

随着5G通信技术的发展与应用,高可靠低时延通信场景下的短包信道编译码技术受到了广泛关注.GRAND是一种通用的最大似然译码算法,与传统译码算法不同,GRAND算法通过噪声猜测和码本查询来确定发送码字,具有高效的硬件实现结构.介绍了GRAND及其改进算法的基本原理,通过仿真分析了不同GRAND算法的误码率性能;针对5G NR的LDPC短码以及PAC短码给出了GRAND算法的设计方案,为未来移动通信的短码设计提供参考.

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.

史治平;杨娟;李坤阳;王玥

电子科技大学通信抗干扰全国重点实验室,四川成都 611731桂林航天工业学院,广西桂林 541004

电子信息工程

短码GRAND算法线性分组码

short codesGRAND decodinglinear block codes

《移动通信》 2024 (005)

49-54 / 6

国家自然科学基金面上项目"短码通用译码算法GRAND及其应用研究"(62371101)

10.3969/j.issn.1006-1010.20240427-0001

评论