List-Based Optimization of Proximal Decoding for LDPC Codes

被引:0
作者
Tsouchlos, Andreas [1 ]
Jaekel, Holger [1 ]
Schmalen, Laurent [1 ]
机构
[1] Karlsruhe Inst Technol KIT, Commun Engn Lab CEL, D-76131 Karlsruhe, Germany
基金
欧洲研究理事会;
关键词
Iterative decoding; Maximum likelihood decoding; Optimization; Oscillators; Polynomials; Linear programming; Convergence; Optimization-based decoding; proximal decoding; ML-in-the-list;
D O I
10.1109/LCOMM.2024.3458422
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this letter, the proximal decoding algorithm is considered within the context of additive white Gaussian noise (AWGN) channels. An analysis of the convergence behavior of the algorithm shows that proximal decoding inherently enters an oscillating behavior of the estimate after a certain number of iterations. Due to this oscillation, frame errors arising during decoding can often be attributed to only a few remaining wrongly decoded bit positions. In this letter, an improvement of the proximal decoding algorithm is proposed by establishing an additional step, in which these erroneous positions are attempted to be corrected. We suggest an empirical rule with which the components most likely needing correction can be determined. Using this insight and performing a subsequent "ML-in-the-list" decoding, a gain of up to 1 dB is achieved compared to conventional proximal decoding, depending on the decoder parameters and the code.
引用
收藏
页码:2464 / 2467
页数:4
相关论文
共 11 条
[1]   Decomposition Methods for Large Scale LP Decoding [J].
Barman, Siddharth ;
Liu, Xishuo ;
Draper, Stark C. ;
Recht, Benjamin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) :7870-7886
[3]   Using linear programming to decode binary linear codes [J].
Feldman, J ;
Wainwright, MJ ;
Karger, DR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :954-972
[4]   Automorphism Ensemble Decoding of Reed-Muller Codes [J].
Geiselhart, Marvin ;
Elkelesh, Ahmed ;
Ebada, Moustafa ;
Cammerer, Sebastian ;
ten Brink, Stephan .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (10) :6424-6438
[5]  
MacKay D. J., 2023, Encyclopedia of Sparse Graph Codes
[6]   Good error-correcting codes based on very sparse matrices [J].
MacKay, DJC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431
[7]  
Parikh N., 2014, Proximal Algorithms, V1
[8]  
Ryan W.E., 2009, CHANNEL CODES CLASSI, Vfirst
[9]   Adaptive linear programming decoding [J].
Taghavi, Mohammad H. ;
Siegel, Paul H. .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :1374-+
[10]  
Vontobel Pascal O., 2008, 2008 Information Theory and Applications Workshop Conference, P433, DOI 10.1109/ITA.2008.4601085