Optimization of Protograph LDPC Codes via Surrogate Channel for Unequal Power Allocation

被引:7
作者
Chen, Qiwang [1 ]
He, Yu-Cheng [1 ]
Chen, Chen [1 ]
Zhou, Lin [1 ]
机构
[1] Huaqiao Univ, Sch Informat Sci & Engn, Key Lab Mobile Multimedia Commun, Xiamen 361021, Peoples R China
基金
中国国家自然科学基金;
关键词
Nonuniform source; PEXIT; protograph LDPC codes; surrogate channel; unequal power allocation; PARITY-CHECK CODES; NONUNIFORM MEMORYLESS SOURCES; JOINT SOURCE; BANDWIDTH-EFFICIENT; DESIGN; PERFORMANCE; MODULATION;
D O I
10.1109/TCOMM.2023.3237845
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the possibilities of optimizing existing protograph low-density parity-check (PLDPC) codes and designing optimal PLDPC codes on both AWGN and Rayleigh channels under binary modulation with unequal power allocation (UPA) for nonuniform sources. While the binary UPA modulation achieves a power gain, it also results in unequal error protection on the coded bits in systematic codewords during transmission. For irregular codes, it is possible to best protect the information bits by optimizing the classification of variable nodes (VNs). Those VNs represent the coded bits in protograph that allows exploiting jointly the degree irregularity and the power differentiation. An algorithm for UPA-based protograph extrinsic information transfer (UPA-PEXIT) analysis on the Rayleigh channel is proposed with the concept of surrogate channel which circumvents the channel asymmetry problem with UPA. With the RJA code as example, it is shown that classification optimization does improve the decoding threshold when the source entropy is small. To design optimal codes, a UPA-based differential evolution (UPA-DE) algorithm is proposed in conjunction with the UPA-PEXIT analysis. A family of optimized codes are illustrated for three typical nonuniform source distributions and compared with the RJA and NND codes by simulations in error rate performance.
引用
收藏
页码:1284 / 1295
页数:12
相关论文
共 32 条
[1]   Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation [J].
Boecherer, Georg ;
Steiner, Fabian ;
Schulte, Patrick .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (12) :4651-4665
[2]   Bit-interleaved coded modulation [J].
Caire, G ;
Taricco, G ;
Biglieri, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :927-946
[3]   Integrated Design of JS']JSCC Scheme Based on Double Protograph LDPC Codes System [J].
Chen, Qiwang ;
Wang, Lin ;
Hong, Shaohua ;
Chen, Yifan .
IEEE COMMUNICATIONS LETTERS, 2019, 23 (02) :218-221
[4]   Low Density Parity Check Codes with Non-Equiprobable Symbols [J].
Dai, Bowen ;
Wei, Lei .
IEEE COMMUNICATIONS LETTERS, 2013, 17 (11) :2124-2127
[5]   Capacity-Approaching Protograph Codes [J].
Divsalar, Dariush ;
Dolinar, Sam ;
Jones, Christopher R. ;
Andrews, Kenneth .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :876-888
[6]   Joint Source and Channel Coding Using Double Polar Codes [J].
Dong, Yanfei ;
Niu, Kai ;
Dai, Jincheng ;
Wang, Sen ;
Yuan, Yifei .
IEEE COMMUNICATIONS LETTERS, 2021, 25 (09) :2810-2814
[7]   EXIT Charts for System Design and Analysis [J].
El-Hajjar, Mohammed ;
Hanzo, Lajos .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2014, 16 (01) :127-153
[8]   OUTAGE-LIMIT-APPROACHING CHANNEL CODING FOR FUTURE WIRELESS COMMUNICATIONS Root-Protograph Low-Density Parity-Check Codes [J].
Fang, Yi ;
Chen, Pingping ;
Cai, Guofa ;
Lau, Francis C. M. ;
Liew, Soung Chang ;
Han, Guojun .
IEEE VEHICULAR TECHNOLOGY MAGAZINE, 2019, 14 (02) :85-93
[9]   Does the performance of LDPC codes depend on the channel? [J].
Franceschini, Michele ;
Ferrari, Gianluigi ;
Raheli, Riccardo .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (12) :2129-2132
[10]   Joint Source and Channel Coding [J].
Fresia, Maria ;
Perez-Cruz, Fernando ;
Poor, H. Vincent ;
Verdu, Sergio .
IEEE SIGNAL PROCESSING MAGAZINE, 2010, 27 (06) :104-113