Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

现代传播:中国传媒大学学报

Research of LDPC Decoding Algorithms for New-generation Digital Communication System

Lu Si

Published Jan 1, 2013• 0 citations
OpenAlex

Related papers

Research on Simplified Algorithms for LDPC Decoding in High Order Modulation

Li Hua Xu, Daoxing Guo, Chunqiang Shi

Lecture notes in electrical engineering•Dec 5, 2012•0 citations

Performance Analysis of LDPC Decoding Techniques

Abdel Halim A. Zikry, Ashraf Yehya Hassan, Wageda I. Shaban +1 more

Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital communications systems, like DVB-S2 and WLAN802.1..This paper aims to know what is LDPC,what its application and introduce encoding algorithms that gives rise to a linear encoding time and also show that the regular and irregular LDPC performance and also introduce different methods for decoding LDPC. I discuss in detail LDPC decoding algorithm: bit flipping algorithm, as a type from hard decision .belief propagation algorithm, sum product algorithm and minimum sum algorithm as examples from soft decision .I expect that at least some students or researchers involved in researching LDPC codes would find this paper helpful.

International Journal of Recent Technology and Engineering (IJRTE)•Jan 30, 2021•7 citations

Investigations on certain LDPC decoding algorithms for efficient hardware implementation

Michaelraj Kingston Roberts

•Aug 1, 2015•0 citations

Resource efficient flexible architectures for low-density parity-check decoders

Vikram Arkalgud Chandrasetty

Digital communication has become part of most applications we use today.It could be for internet access using WLAN/WiMAX technology or satellite based Digital Video Broadcasting (DVB) or even mobile applications.It may be possible to achieve very high communication bandwidth for these applications.But the problem is with the reliability of information received over the communication channel that is often subjected to noise.The obvious solution to this problem is incorporating error correction techniques in the communication system to correct the errors introduced during transit.One of the best performing error correction codes are Low-Density Parity-Check (LDPC) codes discovered by Gallager in 1962, but these codes only gained popularity over the last decade or so.LDPC codes can achieve excellent bit error rate (BER) performance and are very suitable for next-generation communication systems.Studies have shown that large LDPC codes can achieve BER performance very close to the Shannon Limit.Hence these codes are of paramount interest among the research community.However, practical implementation of high performance LDPC decoders with large code lengths is a challenge faced by designers today due to the huge complexity and hardware resources required.This research aims to reduce the complexity of LDPC decoding algorithms and explore resource efficient architectures for hardware implementation.LDPC decoders are primarily based on iterative algorithms and typically consist of large number of computational nodes, with complex interconnections among the nodes.A fully-parallel implementation of LDPC decoder with large code length can provide high throughput, but is costly in terms of hardware resources required.Even today's high-end FPGAs

•Jan 1, 2012•0 citations

Design and decoding algorithms of non-binary LDPC codes

Kenta Kasai, Kohichi Sakaniwa

IEICE Technical Report; IEICE Tech. Rep.•Dec 3, 2009•0 citations

Dual Threshold Self-Corrected Minimum Sum Algorithm for 5G LDPC Decoders

Rong Chen, Lan Chen

Fifth generation (5G) is a new generation mobile communication system developed for the growing demand for mobile communication. Channel coding is an indispensable part of most modern digital communication systems, for it can improve the transmission reliability and anti-interference. In order to meet the requirements of 5G communication, a dual threshold self-corrected minimum sum (DT-SCMS) algorithm for low-density parity-check (LDPC) decoders is proposed in this paper. Besides, an architecture of LDPC decoders is designed. By setting thresholds to judge the reliability of messages, the DT-SCMS algorithm erases unreliable messages, improving the decoding performance and efficiency. Simulation results show that the performance of DT-SCMS is better than that of SCMS. When the code rate is 1/3, the performance of DT-SCMS has been improved by 0.2 dB at the bit error rate of 10 − 4 compared with SCMS. In terms of the convergence, when the code rate is 2/3, the number of iterations of DT-SCMS can be reduced by up to 20.46% compared with SCMS, and the average proportion of reduction is 18.68%.

Information•Jul 7, 2020•3 citations
Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital communications systems, like DVB-S2 and WLAN802.1..This paper aims to know what is LDPC,what its application and introduce encoding algorithms that gives rise to a linear encoding time and also show that the regular and irregular LDPC performance and also introduce different methods for decoding LDPC. I discuss in detail LDPC decoding algorithm: bit flipping algorithm, as a type from hard decision .belief propagation algorithm, sum product algorithm and minimum sum algorithm as examples from soft decision .I expect that at least some students or researchers involved in researching LDPC codes would find this paper helpful.
Digital communication has become part of most applications we use today.It could be for internet access using WLAN/WiMAX technology or satellite based Digital Video Broadcasting (DVB) or even mobile applications.It may be possible to achieve very high communication bandwidth for these applications.But the problem is with the reliability of information received over the communication channel that is often subjected to noise.The obvious solution to this problem is incorporating error correction techniques in the communication system to correct the errors introduced during transit.One of the best performing error correction codes are Low-Density Parity-Check (LDPC) codes discovered by Gallager in 1962, but these codes only gained popularity over the last decade or so.LDPC codes can achieve excellent bit error rate (BER) performance and are very suitable for next-generation communication systems.Studies have shown that large LDPC codes can achieve BER performance very close to the Shannon Limit.Hence these codes are of paramount interest among the research community.However, practical implementation of high performance LDPC decoders with large code lengths is a challenge faced by designers today due to the huge complexity and hardware resources required.This research aims to reduce the complexity of LDPC decoding algorithms and explore resource efficient architectures for hardware implementation.LDPC decoders are primarily based on iterative algorithms and typically consist of large number of computational nodes, with complex interconnections among the nodes.A fully-parallel implementation of LDPC decoder with large code length can provide high throughput, but is costly in terms of hardware resources required.Even today's high-end FPGAs
Fifth generation (5G) is a new generation mobile communication system developed for the growing demand for mobile communication. Channel coding is an indispensable part of most modern digital communication systems, for it can improve the transmission reliability and anti-interference. In order to meet the requirements of 5G communication, a dual threshold self-corrected minimum sum (DT-SCMS) algorithm for low-density parity-check (LDPC) decoders is proposed in this paper. Besides, an architecture of LDPC decoders is designed. By setting thresholds to judge the reliability of messages, the DT-SCMS algorithm erases unreliable messages, improving the decoding performance and efficiency. Simulation results show that the performance of DT-SCMS is better than that of SCMS. When the code rate is 1/3, the performance of DT-SCMS has been improved by 0.2 dB at the bit error rate of 10 − 4 compared with SCMS. In terms of the convergence, when the code rate is 2/3, the number of iterations of DT-SCMS can be reduced by up to 20.46% compared with SCMS, and the average proportion of reduction is 18.68%.