摘要
设计极化码灵活串行消除列表译码算法,根据当前节点所属叶节点中的路径扩展比特数量来判断是否在当前节点进行译码。基于码树结构,利用稀疏特性和极化特性提升码字的译码节点层级,实现高效低时延的译码器。通过改变确信比特的比例,灵活地进行译码性能和译码时延的优化调整,满足未来6G系统超高可靠低时延的要求。
A flexible successive cancellation list(FSCL) decoding algorithm for polar codes is proposed, where the decoding process at the current node is determined by the number of path-extended bits in its subordinate leaf nodes. Based on the code tree structure, the sparsity and polarization characteristics are used to level up the layer of decoding nodes, and a high-efficiency and low-latency decoder is realized. Via adjusting the ratio of trusted bits, the decoding performance and latency can be flexibly optimized and adjusted to meet the requirements of ultra-reliable and low-latency transmission for the future 6G system.
作者
魏浩
张梦洁
王东明
WEI Hao;ZHANG Mengjie;WANG Dongming(ZTE Corporation,Shenzhen 518055,China;State Key Laboratory of Mobile Network and Mobile Multimedia Technology,Shenzhen 518055,China;National mobile communications research lab.,Southeast University,Nanjing 210096,China;Purple Mountain Laboratories,Nanjing 211111,China)
出处
《移动通信》
2022年第6期64-71,共8页
Mobile Communications
基金
国家科技重点研发计划(2020YFB1807200)。
关键词
确信比特
低时延
稀疏特性
极化特性
trusted bit
low latency
sparsity characteristics
polarization characteristics
