Improved Layered Minimum Sum Decoding Algorithm Based on Overestimation
Authors: 
Liu Yu, Lin Bai, Yaohui HaoAuthors Info & Claims
Liu Yu, Lin Bai, Yaohui HaoAuthors Info & ClaimsPages 1088 - 1092
Abstract
Quasi-cyclic low-density parity-check (QC-LDPC) codes are linear block codes with performance close to the Shannon limit. The layered minimum sum (LMS) decoding algorithm speeds up the decoding convergence by layering the check matrix and updating the nodes according to the layers. However, the MS algorithm has the problem of over estimation and affects the decoding performance due to its simplified strategy of MS algorithm updating the message of check nodes. Therefore, this paper proposes a layered minimum sum decoding algorithm based on overestimation. By setting the correction threshold and updating the check nodes by the conditions, the decoding performance is improved. When the code length is 2048 and the bit error rate is, the proposed algorithm can improve the decoding convergence speed by about 25% and obtain a coding gain of about 0.1 dB.
References
[1]
R. Gallager, "Low-density parity-check codes," in IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21-28, January 1962.
[2]
T. J. Richardson, M. A. Shokrollahi and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," in IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, Feb 2001.
[3]
Zheng W, Ma X Y and Zhao C C, "An improved BP decoding algorithm of LDPC codes," in Journal of HeBei University (Natural Science Edition), vol. 37, no. 4, pp. 532-535+591, December 2016.
[4]
M. P. C. Fossorier, "Quasicyclic low-density parity-check codes from circulant permutation matrices," in IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
[5]
Yang W G, “Modified LDPC Codes Min-sum Algorithm Based on Reducing the Over-estimation," in Command Control & Simulation., vol. 39, no. 6, pp. 53-57, December 2017.
[6]
X. Zheng, Q. Hu and J. Feng, "Two Improved Algorithms for Layered QC-LDPC Decoding Algorithm," 2018 IEEE Canadian Conference on Electrical & Computer Engineering (CCECE), 2018, pp. 1-4.
[7]
Zhou F, Niu L L and Tian B H, "Low Complexity LDPC Decoding Algorithm Based on Hierarchical Messaging Mechanism," in Journal of Projectiles, Rockets, Missile and Guidance, vol. 40, no. 4, pp. 110-112+117, May 2020.
[8]
Roberts, M.K., Mohanram, S.S. & Shanmugasundaram, N. An Improved Low Complex Offset Min-Sum Based Decoding Algorithm for LDPC Codes. Mobile Netw Appl 24, 2019, pp. 1848-1852.
[9]
V. L. Petrović and D. M. El Mezeni, "Reduced-Complexity Offset Min-Sum Based Layered Decoding for 5G LDPC Codes," 2020 28th Telecommunications Forum (TELFOR), 2020, pp. 1-4.
[10]
Fan Y N, Wang L C, Yao X J, "Overlapped layered belief propagation LDPC decoding algorithm," in Journal of Xi Dian University, vol. 44 no. 2, pp. 88-94. September 2017.
[11]
Jiang X B and Li F Y, "Alternate iteration hierarchical confidence propagation decoding of LDPC codes, " in Journal of Circuits and Systems, vol. 18, no. 1, pp. 423-426+431, February 2013.
[12]
Zhang S, Ma L H, Tian Y, "Improving layered decoding algorithm for LDPC codes based on integer operation," in System Engineering and Electronics, vol.35, no. 3, pp. 638-642, March 2013.
[13]
Lao L L, Li L X, Zhu M, "Improved hierarchical decoding algorithm based on integer quantization LDPC codes, " in Journal of Northwestern Polytechnical University, vol. 32, no. 6, pp. 974-980, December 2014.
Index Terms
- Improved Layered Minimum Sum Decoding Algorithm Based on Overestimation
Recommendations
Improved layered min-sum decoding algorithm for low density parity check codes
MUSP'09: Proceedings of the 9th WSEAS international conference on Multimedia systems & signal processingIn this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. ...
Quasi-orthogonal STBC with minimum decoding complexity
In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum-likelihood (...
Sum-Product Decoding of BCH Codes
This paper proposes methods to improve soft-input and soft-output decoding performance of BCH codes by sum-product algorithm (SPA). A method to remove cycles of length four (RmFC) in the Tanner graph has been proposed. However, the RmFC can not realize ...
Comments
Information & Contributors
Information
Published In
September 2022
1221 pages
ISBN:9781450396899
DOI:10.1145/3573942
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 May 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
AIPR 2022
AIPR 2022: 2022 5th International Conference on Artificial Intelligence and Pattern Recognition
September 23 - 25, 2022
Xiamen, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 24Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format