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

International Journal of Engineering Development and Research

Performance Evaluation of Bit Flipping and Sum Product Algorithm of LDPC coder in Different Channel Environment

nbspJigisha Patel, nbspNeeta Chapatwala, nbspMrugesh Patel

Published Jun 1, 2014• 0 citations
OpenAlex

Related papers

Performance Evaluation of a Combination of Sum-Product and Two-bit Bit Flipping Decoding Algorithms

Koh Matsushita, Hiroshi Kamabe

IEICE Technical Report; IEICE Tech. Rep.•Feb 28, 2013•0 citations

Bit Flipping-Sum Product Algorithm for regular LDPC codes

Rachid El Alami, Cheikh Bamba Gueye, Mohammed Boussetta +2 more

In this paper we present Low Density Parity Check decoding algorithm that assemble two different algorithms: Sum-Product and Bit-Flipping; we denote Bit Flipping-Sum Product Algorithm (BFSP). To reduce the bit error rate, we perform the Bit-Flipping algorithm after the Sum-Product algorithm. Simulation results over an additive white Gaussian channel show that the error performance of a LDPC codes with Bit Flipping-Sum Product decoding is within 0.2 dB of the standard Sum-Product decoding algorithms. Furthermore, the decoding complexity of the proposed BFSP algorithm is maintained at the same level as that of the standard Sum-Product algorithm.

International Symposium on I/V Communications and Mobile Network (ISIVC)•Sep 1, 2010•3 citations

BER Performance Comparison of Bit Flipping Algorithms used for Decoding of LDPC Codes

G Pavithra, M Naveen Kumar

•Jan 6, 2015•0 citations

BER Performance Comparison of Bit Flipping Algorithms used for Decoding of LDPC Codes

G. Pavithra, Naveen Kumar M.

International Journal of Engineering Research and•Jun 1, 2015•1 citation

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

Performance Evaluation of Bit-Flipping Based Algorithms for LDPC Convolutional Codes

Oulfa Laouar, Imed Amamra, Nadir Derouiche

International Multi-Conference on Systems, Signals & Devices (SSD)•May 6, 2022•4 citations
In this paper we present Low Density Parity Check decoding algorithm that assemble two different algorithms: Sum-Product and Bit-Flipping; we denote Bit Flipping-Sum Product Algorithm (BFSP). To reduce the bit error rate, we perform the Bit-Flipping algorithm after the Sum-Product algorithm. Simulation results over an additive white Gaussian channel show that the error performance of a LDPC codes with Bit Flipping-Sum Product decoding is within 0.2 dB of the standard Sum-Product decoding algorithms. Furthermore, the decoding complexity of the proposed BFSP algorithm is maintained at the same level as that of the standard Sum-Product algorithm.
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.