The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Comparative Analysis of Belief Propagation and Layered Decoding Algorithms for LDPC Codes
|
|
Author(s): Channaveeramma E. (Navodaya Institute of Technology, India)and K. M. Palaniswamy (Dr. T. Thimmaiah Institute of Technology, India)
Copyright: 2024
Pages: 23
Source title:
Explainable AI Applications for Human Behavior Analysis
Source Author(s)/Editor(s): P. Paramasivan (Dhaanish Ahmed College of Engineering, India), S. Suman Rajest (Dhaanish Ahmed College of Engineering, India), Karthikeyan Chinnusamy (Veritas, USA), R. Regin (SRM Institute of Science and Technology, India)and Ferdin Joe John Joseph (Thai-Nichi Institute of Technology, Thailand)
DOI: 10.4018/979-8-3693-1355-8.ch005
Purchase
|
Abstract
Wireless digital communication enables instantaneous connections and conversations between people all over the world. In a digital communication system, the channel code is used to detect and fix errors. The most widely used error-correcting codes are LDPC channel codes, which are represented by a sparse parity-check matrix and have performance close to the Shannon limit. The sophistication and versatility of decoders determines the error-correcting codes' efficacy. LDPC codes are used in a wide variety of broadcasting, satellite communication, LAN, and PAN applications because of their capacity-approaching properties. Sparsity allows for the use of LDPC codes; however, simplified decoding algorithms play a crucial role in achieving high-speed, error-free communication. In this work, we focus on locating a decoding algorithm with the lowest possible complexity and the fewest possible iterations. The belief propagation algorithm and layered decoding or turbo decoding algorithms are with the code rates ½, ¾,5/8, and 13/16, which are compatible with the WLAN (IEEE Std 802.11™-2016 (Revision of IEEE Std 802.11-2012, 2012) standard. In terms of bit error rate, layered decoding or turbo decoding of the message forwarding method performs better. It is also seen that performance improves with an increase in the number of iterations.
Related Content
|
Kula A. Francis, Kenny A. Hendrickson.
© 2026.
26 pages.
|
|
Summyr Burton, Savannah Baus, Stephen A. Murphy.
© 2026.
50 pages.
|
|
Kesley Richardson, Colby Cavanaugh.
© 2026.
30 pages.
|
|
Angela M. Hill, Kevin B. Sneed, Deborah Austin, Deanna B. Wathington, Hiram B. Green, Michael B. Morgan, Janet B. Roman, Feng B. Cheng, John E. Clark, Natasha Rubie, Kristy Andre, Thea Moore, Antionette Davis, Feng Cheng, Karia Doreen MacAulay, Maisha Standifer, Judette Louis, Joseph Diamond, Kyaien Conner, Victor Obi, Samantha Thompson.
© 2026.
22 pages.
|
|
Angela Stephanie Mazzetti, Anniken Grønstad, John Blenkinsopp.
© 2026.
32 pages.
|
|
Marie Grace Avelino Gomez, Kenith B Villaruel.
© 2026.
30 pages.
|
|
Carolyn Allen.
© 2026.
30 pages.
|
|
|