scholarly journals Matching Pursuit Algorithm for Decoding of Binary LDPC Codes

2021 ◽  
Vol 2021 ◽  
pp. 1-5
Author(s):  
Jianzhong Guo ◽  
Cong Cao ◽  
Dehui Shi ◽  
Jing Chen ◽  
Shuai Zhang ◽  
...  
Keyword(s):  
Error Probability ◽  
High Efficiency ◽  
Matching Pursuit ◽  
Ldpc Codes ◽  
Inner Product ◽  
Parity Check ◽  
Decoding Algorithms ◽  
Low Density Parity Check ◽  
Matching Pursuit Algorithm ◽  
Simulation Results

This paper presents a novel hard decision decoding algorithm for low-density parity-check (LDPC) codes, in which the stand matching pursuit (MP) is adapted for error pattern recovery from syndrome over GF(2). In this algorithm, the operation of inner product can be converted into XOR and accumulation, which makes the matching pursuit work with a high efficiency. In addition, the maximum iteration is theoretically explored in relation to sparsity and error probability according to the sparse theory. To evaluate the proposed algorithm, two MP-based decoding algorithms are simulated and compared over an AWGN channel, i.e., generic MP (GMP) and syndrome MP (SMP). Simulation results show that the GMP algorithm outperforms the SMP by 0.8 dB at BER = 10 − 5 .

FPGA Implementation of a Novel Multi-Rate QC-LDPC Encoder for DTMB Standard

2013 ◽  
Vol 397-400 ◽  
pp. 2024-2027
Author(s):  
Fei Wang ◽  
Peng Zhang ◽  
Chang Yin Liu
Keyword(s):  
Power Consumption ◽  
Ldpc Codes ◽  
Fpga Implementation ◽  
Type I ◽  
Low Density ◽  
Parity Check ◽  
Encoding Scheme ◽  
Low Density Parity Check ◽  
Memory Resource ◽  
Simulation Results

A serial-input serial-output encoder based on pipelined type I rotate-left-accumulator (RLA) circuit is presented for multi-rate Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes of Digital Terrestrial Multimedia Broadcasting (DTMB) standard. This encoding scheme can reduce the power consumption and save memory resource. FPGA implementation and simulation results show that the design meets the requirement of DTMB standard and simplifies the structure of the memory.

scholarly journals The Decoding Algorithms For Error-Correcting Product Codes Based On Project Geometry Low-Density Parity-Check Codes

2020 ◽  
Vol 12 (3) ◽  
pp. 399-406
Author(s):  
Lev E. Nazarov ◽  
Keyword(s):  
Turbo Codes ◽  
Ldpc Codes ◽  
Parity Check ◽  
Decoding Algorithm ◽  
Signal Noise ◽  
Product Codes ◽  
Decoding Algorithms ◽  
Low Density Parity Check ◽  
Code Constructions ◽  
Parity Check Codes

The focus of this paper is directed towards the investigation of the characteristics of symbol-by-symbol iterative decoding algorithms for error-correcting block product-codes (block turbo-codes) which enable to reliable information transfer at relatively low received signal/noise and provide high power efficiency. Specific feature of investigated product codes is construction with usage of low-density parity-check codes (LDPC) and these code constructions are in the class of LDPC too. According to this fact the considered code constructions have symbol-by-symbol decoding algorithms developed for total class LDPC codes, namely BP (belief propagation) and its modification MIN_SUM_BP. The BP decoding algorithm is iterative and for implementation the signal/noise is required, for implementation of MIN_SUM_BP decoding algorithm the signal/noise is not required. The resulted characteristics of product codes constructed with usage of LDPC based on project geometry (length of code words, information volume, code rate, error performances) are presented in this paper. These component LDPC codes are cyclic and have encoding and decoding algorithms with low complexity implementation. The computer simulations for encoding and iterative symbol-by-symbol decoding algorithms for the number of turbo-codes with different code rate and information volumes are performed. The results of computer simulations have shown that MIN_SUM_BP decoding algorithm is more effective than BP decoding algorithm for channel with additive white gaussian noise concerning error-performances.

Modified Bit-Flipping Decoding of Low-Density Parity-Check Codes

2013 ◽  
Vol 710 ◽  
pp. 723-726
Author(s):  
Yuan Hua Liu ◽  
Mei Ling Zhang
Keyword(s):  
High Throughput ◽  
Error Probability ◽  
Ldpc Codes ◽  
Low Complexity ◽  
Low Density ◽  
Parity Check ◽  
Excellent Performance ◽  
Low Density Parity Check ◽  
Lower Complexity ◽  
Parity Check Codes

A novel bit-flipping (BF) algorithm with low complexity for high-throughput decoding of low-density parity-check (LDPC) codes is presented. At each iteration, a novel threshold pattern is used to determine the code bits whether to be flipped or not, and the flipping error probability is effectively decreased. Compared with the weighted BF algorithm and its modifications, the modified BF algorithm has significantly lower complexity and decoding time. Through simulations the proposed BF algorithm is shown to achieve excellent performance and fast convergence speed while maintaining significantly low complexity thus facilitating high-throughput decoding.

Study on a New Joint Source-Channel Decoder Design

2013 ◽  
Vol 340 ◽  
pp. 471-475
Author(s):  
Fei Zhong ◽  
Shu Xu Guo
Keyword(s):  
Iterative Decoding ◽  
Ldpc Codes ◽  
Low Density ◽  
Parity Check ◽  
Information Redundancy ◽  
Low Density Parity Check ◽  
Error Ratio ◽  
Bit Error Ratio ◽  
Simulation Results ◽  
Decoder Design

To improve upon the Low-Density Parity-Check (LDPC) codes , incorporating compressed sensing (CS) and information redundancy, a new joint decoding algorithm frame is presented. The proposed system exploits the information redundancy by CS reconstruction during the iterative decoding process to correct decoding of LDPC codes. The simulation results show that the algorithm presented can improve system decoding performance and obviously make bit error ratio (BER) lower then traditional LDPC codes. In addition, a relatively short argument is given on different CS reconstructed algorithms in proposed system, the new design is shown to benefit from different CS reconstructed algorithms.

scholarly journals Error Exponents of LDPC Codes under Low-Complexity Decoding

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 253
Author(s):  
Pavel Rybin ◽  
Kirill Andreev ◽  
Victor Zyablov
Keyword(s):  
Linear Codes ◽  
Ldpc Codes ◽  
Low Complexity ◽  
Parity Check ◽  
Error Exponent ◽  
Error Exponents ◽  
Decoding Algorithms ◽  
Symmetric Channel ◽  
Low Density Parity Check ◽  
Specific Construction

This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity decoding algorithms. We prove the existence of such LDPC codes that the probability of erroneous decoding decreases exponentially with the growth of the code length while keeping coding rates below the corresponding channel capacity. We also show that an obtained error exponent lower bound under ML decoding almost coincide with the error exponents of good linear codes.

Sign in / Sign up

Export Citation Format

Share Document