Reliability Ratio-Based Serial Algorithm of LDPC Decoder for Turbo Equalization Schemes

被引:1
作者
Khittiwitchayakul, Sirawit [1 ]
Phakphisut, Watid [1 ]
Supnithi, Pornchai [1 ]
机构
[1] King Mongkuts Inst Technol Ladkrabang, Sch Engn, Bangkok 10520, Thailand
关键词
Decoding; Belief propagation; Iterative decoding; Detectors; Convergence; Media; Magnetic recording; bit patterned media; low-density parity-check (LDPC) codes; serial algorithm; turbo equalization; BELIEF-PROPAGATION; MEDIA; PERFORMANCE; COMPLEXITY; CODES;
D O I
10.1109/TMAG.2021.3081732
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Serial decoding algorithms of low-density parity-check (LDPC) code converge efficiently with low errors. Previously, a serial decoding algorithm, named a shuffled belief-propagation (SBP), was applied in turbo equalization of bit-patterned magnetic recording (BPMR) systems. With the SBP algorithm, an LDPC decoder converged twice as fast as one using conventional BP algorithms. We further improved the convergence speed of SBP by updating the messages in an adaptive order, which played a flexible role throughout decoding. We proposed two adaptive-serial algorithms for LDPC codes in turbo equalization. One updated the messages using the extrinsic loglikelihood ratio (LLR) and the result of the parity-check equation checking. The second contained an additional rule that tracked the LLR sign changes in each iteration. Both algorithms converged faster and with lower bit error rates (BERs) than the SBP and previous adaptive-serial algorithms in a BPMR system with media noise.
引用
收藏
页数:5
相关论文
共 18 条
[1]  
Elidan G., 2012, ARXIV12066837
[2]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[3]   Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes [J].
Guo, F ;
Hanzo, L .
ELECTRONICS LETTERS, 2004, 40 (21) :1356-1358
[4]  
Hocevar DE, 2004, 2004 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, PROCEEDINGS, P107
[5]   Regular and irregular progressive edge-growth tanner graphs [J].
Hu, XY ;
Eleftheriou, E ;
Arnold, DM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398
[6]   Performance and Complexity of 32 k-bit Binary LDPC Codes for Magnetic Recording Channels [J].
Jeon, Seungjune ;
Kumar, B. V. K. Vijaya .
IEEE TRANSACTIONS ON MAGNETICS, 2010, 46 (06) :2244-2247
[7]  
Kim J., 2008, 2008 IEEE IND APPL S, P1, DOI DOI 10.1109/08IAS.2008.196
[8]  
Lechner G., 2002, P MIN WORKSH TOP INF, P12
[9]   Two Informed Dynamic Scheduling Strategies for Iterative LDPC Decoders [J].
Lee, Huang-Chang ;
Ueng, Yeong-Luh ;
Yeh, Shan-Ming ;
Weng, Wen-Yen .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (03) :886-896
[10]   Variable-Node-Based Dynamic Scheduling Strategy for Belief-Propagation Decoding of LDPC Codes [J].
Liu, Xingcheng ;
Zhang, Yuanbin ;
Cui, Ru .
IEEE COMMUNICATIONS LETTERS, 2015, 19 (02) :147-150