Low Complexity Successive Cancellation List Decoding of U-UV Codes

作     者：Chen Wenhao Chen Li Lin Jingyu Zhang Huazi Chen Wenhao;Chen Li;Lin Jingyu;Zhang Huazi

作者机构：School of Electronics and Information TechnologySun Yat-sen UniversityGuangzhou 510006China Guangdong Province Key Laboratory of Information Security TechnologyGuangzhou 510006China Hangzhou Research CenterHuawei Technologies Co.Ltd.Hangzhou 310052China 

出 版 物：《China Communications》 (中国通信(英文版))

年 卷 期：2025年第22卷第1期

页      面：41-60页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：supported by the National Natural Science Foundation of China(NSFC)with project ID 62071498 the Guangdong National Science Foundation(GDNSF)with project ID 2024A1515010213 

主　　题：ordered statistics decoding successive cancellation list decoding U-UV codes 

摘      要：Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length ***,this list decoding complexity becomes formidable as the decoding output list size *** is primarily incurred by the *** this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding *** the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword *** is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code ***,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV *** particular,its integration with the improved OSD and BMA is *** results show that significant complexity reduction can be ***,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.