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

Error performance of LDPC decoder using bit flip algorithm

Ashwini Wanjari, Sandeep Kakde, Atish S. Khobragade

Published Apr 1, 2016• 3 citations
Publisher

Abstract

Low density parity check codes nowadays use in modern system due to their excellent performance. There are different message passing algorithm for LDPC codes to decode. In this paper, we have mention bit flip algorithm in brief and gave its bit error performance over AWGN channel via simulation result. For this communication, we use BPSK i.e. Binary phase shift keying digital modulation technique. This algorithm is based on binary decision message passing algorithm. This paper shows bit error performance of bit flip algorithm for different block lengths of LDPC code. The significance of showing bit error performance in this paper is that it shows how efficiently this algorithm works. We have also mention why BPSK modulation technique is more efficient than any other modulation technique.

DOI
10.1109/iccsp.2016.7754139

Related papers

Performance Evaluation of LDPC decoding Algorithm for GF (2)

D Patel Jigisha, Patel Ruchita Kumari

Low Density Parity Check (LDPC) codes are one of the block coding techniques that can approach the Shannon’s limit within a fraction of a decibel for high block lengths. In many digital communication systems, these codes have strong competitors of turbo codes for error control. LDPC codes performance depends on the excellent design of parity check matrix and many diverse research methods have been used by different study groups to evaluate the performance. Unlike many other classes of codes, LDPC codes are already equipped with a fast, probabilistic decoding algorithm. This makes LDPC codes not only attractive from a theoretical point of view, but also very suitable for practical applications. This paper throws hard decision and soft decision algorithm of LDPC. The hard decision algorithm contains Bit flipping algorithm and Soft decoding algorithm contains Sum product algorithm which is used to correct burst error. Sum Product algorithm is also called as belief propagation. Bit flipping and Sum Product algorithms are explained and can be implemented for the generated parity check matrix of (1016x508) for LDPC code with code rate 1/2.

Journal of Emerging Technologies and Innovative Research•Nov 1, 2014•0 citations

Analysis of LDPC code performance over binary symmetric channel

Yuxiang Li

Low-Density Parity-Check code (LDPC) is a kind of linear block error-correcting codes.Sum-product algorithm is an iterative decoding algorithms commonly used in LDPC code decoding.This paper studies into the LDPC code message passing iterative decoding algorithm under the binary symmetric channel (BSC) and simulates the bit error probability,then simulates the convergence of check nodes' and variable nodes' probability density in the iterative process using the method of density evolution.The result show that under a given channel threshold,LDPC code has a good correction performance.

Journal of Northeast Normal University•Jan 1, 2010•0 citations

A systematic approach for achieving low bit error rate of LDPC decoder using MWD algorithm

Shruti Wahane, Sandeep Kakde, Atish S. Khobragade +1 more

One of the most significant barriers for using Low Density Parity Check (LDPC) codes in many wireless communication system and magnetic storage devices is the bit error rate floor phenomena with their complex message passing iterative algorithm. LDPC codes are mostly used in communication system because of its outstanding performance achievement. There are various decoding algorithm for LDPC decoder. In this paper, we presented the mathematical analysis of Minimum Weight Decoding (MWD) algorithm and its error rate performance over Additive White Gaussian Noise (AWGN) channel. A comparison of bit error rate performance over signal to noise ratio (dB) is carried out for different codes such as hamming code, BCH code and LDPC code. This paper shows bit error performance of decoder using minimum weight decoding algorithm. The main significance of this paper is that it shows efficient performance of Minimum Weight Decoding (MWD) algorithm based LDPC Decoder. We presented three classes of codes (1) hamming code, (2) BCH code and (3) LDPC Codes. We demonstrate the effectiveness of LDPC decoder over other two code decoders for the code rate 1/2 and block length (16,8) which is tarnished for its error floors.

International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)•Mar 1, 2017•4 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•5 citations

A Two-Bit Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Jieun Oh, Jeongseok Ha

This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliability bits are exchanged between bit and check nodes as the decoding proceeds. The message update in check nodes is carefully devised with simple bitwise operations, which are especially suitable for high-speed operations. It will be demonstrated that the proposed TB-WBFA achieves a significant performance improvement over existing bit-flipping decoding algorithms by conducting performance comparisons for LDPC codes under various setups, i.e., different rates, lengths, and structures.

IEEE Communications Letters•Feb 26, 2018•16 citations

Hybrid Bit-Flip Decoding Algorithm for LDPC Codes

Changjia Chen

A Hybrid Bit Flip(HBF) decoding algorithm for Low-Density Parity-Check (LDPC) codes is proposed in this paper. The algorithm makes full use of the soft output of belief-propagation (BP) (decoding) algorithm for LDPC codes, and greatly improves the bit error rate (BER) of the classical bit-flip (BF) algorithm. The simulation results in AWGN channel show that the HBF algorithm outperforms the BP algorithm under almost the same computational complexity. Furthermore, the former can achieve much lower error floor than the latter can do.

Journal of Beijing Jiaotong University•Jan 1, 2005•2 citations
Low density parity check codes nowadays use in modern system due to their excellent performance. There are different message passing algorithm for LDPC codes to decode. In this paper, we have mention bit flip algorithm in brief and gave its bit error performance over AWGN channel via simulation result. For this communication, we use BPSK i.e. Binary phase shift keying digital modulation technique. This algorithm is based on binary decision message passing algorithm. This paper shows bit error performance of bit flip algorithm for different block lengths of LDPC code. The significance of showing bit error performance in this paper is that it shows how efficiently this algorithm works. We have also mention why BPSK modulation technique is more efficient than any other modulation technique.
Low Density Parity Check (LDPC) codes are one of the block coding techniques that can approach the Shannon’s limit within a fraction of a decibel for high block lengths. In many digital communication systems, these codes have strong competitors of turbo codes for error control. LDPC codes performance depends on the excellent design of parity check matrix and many diverse research methods have been used by different study groups to evaluate the performance. Unlike many other classes of codes, LDPC codes are already equipped with a fast, probabilistic decoding algorithm. This makes LDPC codes not only attractive from a theoretical point of view, but also very suitable for practical applications. This paper throws hard decision and soft decision algorithm of LDPC. The hard decision algorithm contains Bit flipping algorithm and Soft decoding algorithm contains Sum product algorithm which is used to correct burst error. Sum Product algorithm is also called as belief propagation. Bit flipping and Sum Product algorithms are explained and can be implemented for the generated parity check matrix of (1016x508) for LDPC code with code rate 1/2.
Low-Density Parity-Check code (LDPC) is a kind of linear block error-correcting codes.Sum-product algorithm is an iterative decoding algorithms commonly used in LDPC code decoding.This paper studies into the LDPC code message passing iterative decoding algorithm under the binary symmetric channel (BSC) and simulates the bit error probability,then simulates the convergence of check nodes' and variable nodes' probability density in the iterative process using the method of density evolution.The result show that under a given channel threshold,LDPC code has a good correction performance.
One of the most significant barriers for using Low Density Parity Check (LDPC) codes in many wireless communication system and magnetic storage devices is the bit error rate floor phenomena with their complex message passing iterative algorithm. LDPC codes are mostly used in communication system because of its outstanding performance achievement. There are various decoding algorithm for LDPC decoder. In this paper, we presented the mathematical analysis of Minimum Weight Decoding (MWD) algorithm and its error rate performance over Additive White Gaussian Noise (AWGN) channel. A comparison of bit error rate performance over signal to noise ratio (dB) is carried out for different codes such as hamming code, BCH code and LDPC code. This paper shows bit error performance of decoder using minimum weight decoding algorithm. The main significance of this paper is that it shows efficient performance of Minimum Weight Decoding (MWD) algorithm based LDPC Decoder. We presented three classes of codes (1) hamming code, (2) BCH code and (3) LDPC Codes. We demonstrate the effectiveness of LDPC decoder over other two code decoders for the code rate 1/2 and block length (16,8) which is tarnished for its error floors.
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.
This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliability bits are exchanged between bit and check nodes as the decoding proceeds. The message update in check nodes is carefully devised with simple bitwise operations, which are especially suitable for high-speed operations. It will be demonstrated that the proposed TB-WBFA achieves a significant performance improvement over existing bit-flipping decoding algorithms by conducting performance comparisons for LDPC codes under various setups, i.e., different rates, lengths, and structures.
A Hybrid Bit Flip(HBF) decoding algorithm for Low-Density Parity-Check (LDPC) codes is proposed in this paper. The algorithm makes full use of the soft output of belief-propagation (BP) (decoding) algorithm for LDPC codes, and greatly improves the bit error rate (BER) of the classical bit-flip (BF) algorithm. The simulation results in AWGN channel show that the HBF algorithm outperforms the BP algorithm under almost the same computational complexity. Furthermore, the former can achieve much lower error floor than the latter can do.