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

TECHNOLOGY IMPLEMENTATION OF DIFFERENT DECODING TECHNIQUES FOR QUASI CYCLIC LOW DENSITY PARITY CHECK CODES (QC-LDPC)

Geeta Arora

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

This paper presents a different decoding techniques for Quasi-Cyclic (QC) Low Density Parity Check (LDPC) code. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The encoding and decoding processes of these codes are easy to simplify and implement. The algorithm used for encoding and decoding are based on matrices and implemented on MATLAB for simulation results. In this paper decoding technique QC-LDPC is introduced and compare the performance of LDPC and QC-LDPC. The decoding techniques is conducted by different algorithms such as Bit Flipping (BF), Belief Propagation (BP) Log,

Related papers

Analysis on QC-LDPC Decoding Algorithms for WLAN Systems

Xin Lu, Zhan Shaobin, Xu Jiong

Next generation wireless systems, such as IEEE802.11n and 802.16e, need high error-correction capacity to achieve high data rate transmission. Therefore, a low-density parity-check code(LDPC code) is adopted as a FEC code. Quasi-cyclic LDPC code(QC-LDPC) code is an important branch of LDPC code research. IEEE 802.16e proposes a parity-check matrix with quasi-cyclic character which makes the encoding very simply. This paper introduces the encoding process and several decoding algorithms for LDPC including Log-BP algorithm, Min-Sum(MS) algorithm and modified MS algorithm. Simulations results under a next generation wireless LAN system show that MS comparing with the Log-BP performance has approximately 0.5dB loss for high-speed rates codes over AWGN channel, however the performance of normalized MS and row weight matched MS with relatively low complexity is nearly the same as that of Log-BP algorithm.

International Conference on Intelligent Computation Technology and Automation•May 1, 2010•2 citations

A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes

Shu Lin, Keke Liu, Juane Li +1 more

This paper presents a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes which is devised based on the section-wise cyclic structure of their parity-check matrices. The decoding scheme significantly reduces the hardware implementation complexity of a QC-LDPC code decoder in terms of the number of message processing units and the number of wires required to connect the message processing units. A long high-rate high-performance QC-LDPC code is used to demonstrate the effectiveness of the proposed decoding scheme. Using this long code as the mother code, descendant QC-LDPC codes of various lengths and rates can be constructed by puncturing and masking the columns and rows of the parity-check matrix of the mother code. These descendant codes can be decoded by deactivating specific sets of message processing units of the mother decoder.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2014•6 citations

Low Complexity Decoding Algorithm of QC-LDPC Code

Fanglong Yi, Pengjun Wang

Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of the check nodes update. Therefore, it is not required to find the sub-minimum and the computational complexity reduces significantly. Matlab simulation results show that the decoding performance of this algorithm is very near to min-sum (MS) algorithm, and more superior than single min-sum (SMS) algorithm.

IEEE Asia-Pacific Services Computing Conference (APSCC)•Dec 1, 2010•3 citations

Research into Non-binary LDPC Decoding Performance Factors

Ming Diao

The non-binary LDPC is the promotion to the finite GF(q) of binary LDPC codes.The parity check matrix elements is no longer 0 and 1,but collections(0,1,2,…,q-1),while the decoding still uses the efficient iterative decoding based on belief propagation algorithm.This paper focuses on the check matrix of structure of the quasi-cyclic LDPC codes(QC-LDPC) as well as the min-sum decoding algorithm.Then the LDPC codes decoding performance is simulated under different conditions in white Gaussian noise channel(AWGN) with Matlab.Finally,the impact of non-binary LDPC Decoding performance factors is analyzed.

Electronic Science and Technology•Jan 1, 2013•0 citations

On the use of QC-LDPC code for data transfer using short and medium block length

Mohammad Rakibul Islam, Jinsang Kim

Quasi Cyclic Low Density Parity Check codes (QC-LDPC) is proposed to reduce the complexity of the Low Density Parity Check codes (LDPC) further while obtaining the similar performance. Our proposed QC-LDPC presents an improved construction of circulant sub-matrices based QC-LDPC at high SNR. The proposed construction yields a performance gain of about 1 dB at a 0.0003 bit error rate (BER). Proposed code is tested on 4 types of decoding algorithm and compared. Proposed algorithm is also compared with the existing QC-LDPC and the proposed approach outperforms the existing one at high SNR. Simulation is also performed varying the number of horizontal submatrix and the result shows that the parity check matrix with smaller horizontal concatenation shows better performance.

International Conference on Advanced Communication Technology•Feb 15, 2009•3 citations

Construction of the cyclic block-type LDPC codes for low complexity hardware implementation

Kuang-Hao Lin, KyungHi Chang, Chien‐Lin Huang +1 more

In this paper, we construct the cyclic block-type low-density parity-check (CB-LDPC) codes for low complexity hardware implementation. The CB-LDPC code, which is a special class of quasi-cyclic LDPC (QC-LDPC), has an efficient encoding algorithm due to the simple structure of their parity-check matrices. A distribution of irregular parity-check matrix for the CB-LDPC is developed so that we can obtain an area-efficient decoder design, good error correction performance, and low complexity architecture implementation. The CB-LDPC code decoding uses the iterative min-sum algorithm (MSA) and the block parallel connection design to improve the hardware architecture complexity and area.

IEEE International Conference on Electronics, Circuits and Systems (ICECS)•Aug 1, 2008•2 citations
This paper presents a different decoding techniques for Quasi-Cyclic (QC) Low Density Parity Check (LDPC) code. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The encoding and decoding processes of these codes are easy to simplify and implement. The algorithm used for encoding and decoding are based on matrices and implemented on MATLAB for simulation results. In this paper decoding technique QC-LDPC is introduced and compare the performance of LDPC and QC-LDPC. The decoding techniques is conducted by different algorithms such as Bit Flipping (BF), Belief Propagation (BP) Log,
Next generation wireless systems, such as IEEE802.11n and 802.16e, need high error-correction capacity to achieve high data rate transmission. Therefore, a low-density parity-check code(LDPC code) is adopted as a FEC code. Quasi-cyclic LDPC code(QC-LDPC) code is an important branch of LDPC code research. IEEE 802.16e proposes a parity-check matrix with quasi-cyclic character which makes the encoding very simply. This paper introduces the encoding process and several decoding algorithms for LDPC including Log-BP algorithm, Min-Sum(MS) algorithm and modified MS algorithm. Simulations results under a next generation wireless LAN system show that MS comparing with the Log-BP performance has approximately 0.5dB loss for high-speed rates codes over AWGN channel, however the performance of normalized MS and row weight matched MS with relatively low complexity is nearly the same as that of Log-BP algorithm.
This paper presents a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes which is devised based on the section-wise cyclic structure of their parity-check matrices. The decoding scheme significantly reduces the hardware implementation complexity of a QC-LDPC code decoder in terms of the number of message processing units and the number of wires required to connect the message processing units. A long high-rate high-performance QC-LDPC code is used to demonstrate the effectiveness of the proposed decoding scheme. Using this long code as the mother code, descendant QC-LDPC codes of various lengths and rates can be constructed by puncturing and masking the columns and rows of the parity-check matrix of the mother code. These descendant codes can be decoded by deactivating specific sets of message processing units of the mother decoder.
Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of the check nodes update. Therefore, it is not required to find the sub-minimum and the computational complexity reduces significantly. Matlab simulation results show that the decoding performance of this algorithm is very near to min-sum (MS) algorithm, and more superior than single min-sum (SMS) algorithm.
The non-binary LDPC is the promotion to the finite GF(q) of binary LDPC codes.The parity check matrix elements is no longer 0 and 1,but collections(0,1,2,…,q-1),while the decoding still uses the efficient iterative decoding based on belief propagation algorithm.This paper focuses on the check matrix of structure of the quasi-cyclic LDPC codes(QC-LDPC) as well as the min-sum decoding algorithm.Then the LDPC codes decoding performance is simulated under different conditions in white Gaussian noise channel(AWGN) with Matlab.Finally,the impact of non-binary LDPC Decoding performance factors is analyzed.
Quasi Cyclic Low Density Parity Check codes (QC-LDPC) is proposed to reduce the complexity of the Low Density Parity Check codes (LDPC) further while obtaining the similar performance. Our proposed QC-LDPC presents an improved construction of circulant sub-matrices based QC-LDPC at high SNR. The proposed construction yields a performance gain of about 1 dB at a 0.0003 bit error rate (BER). Proposed code is tested on 4 types of decoding algorithm and compared. Proposed algorithm is also compared with the existing QC-LDPC and the proposed approach outperforms the existing one at high SNR. Simulation is also performed varying the number of horizontal submatrix and the result shows that the parity check matrix with smaller horizontal concatenation shows better performance.
In this paper, we construct the cyclic block-type low-density parity-check (CB-LDPC) codes for low complexity hardware implementation. The CB-LDPC code, which is a special class of quasi-cyclic LDPC (QC-LDPC), has an efficient encoding algorithm due to the simple structure of their parity-check matrices. A distribution of irregular parity-check matrix for the CB-LDPC is developed so that we can obtain an area-efficient decoder design, good error correction performance, and low complexity architecture implementation. The CB-LDPC code decoding uses the iterative min-sum algorithm (MSA) and the block parallel connection design to improve the hardware architecture complexity and area.