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

Construction of parity check matrices for non-binarys LDPC codes

Dai Kimura, Ramesh Mahendra Pyndiah, Frédéric Guilloud

Published Apr 3, 2006• 4 citations
OpenAlex

Abstract

This paper presents a novel construction method for parity-check matrices of non-binary LDPC codes which selects nearly optimum non-zero elements in the parity-check matrices. The proposed method can improve the codeweight distribution of non-binary LDPC codes of column weight 2. The decoding performance of the non-binary LDPC codes using the parity-check matrices constructed by the proposed method can outperform that of the random method significantly.

Related papers

Construction of Non-Binary LDPC Codes with Very Large Girth

Xiongfei Tao, Deyu Feng, Yan Zhang +1 more

A non-binary LDPC codes whose parity check matrix has uniform column weight 2 is constructed in this paper. The approach derives a non-binary LDPC codes from a column-weight 2 binary LDPC codes which is designed according to a all one (2, k) matrix, We proposed a search algorithm for constructing a (2, k) LDPC codes with desired girth, and in this paper, we use the search algorithm twice to obtain a code with larger girth. The simulation result shows that the proposed LDPC codes outperform the random codes.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2012•1 citation

A Construction of Non Binary LDPC Codes by Circular Matrices

Sekson Timakul, Somsak Choomchuay

In LDPC code, the structure of code's parity check matrix plays the crucial role in code performance. In this paper proposes the preliminary investigation of a designed parity check matrix from Tanner. We modify this technique in to non binary LDPC structure and decoding with FFT-SPA. We take into high code rate application more than 0.8. The result has shown that in bit error rate (BER) compare between non-binary LDPC and binary LDPC. In our results, the performance of non binary LDPC has better than binary LDPC.

Advanced materials research•Mar 1, 2014•2 citations

Low-density parity-check codes: properties and constructions

Sarah J. Johnson

The construction of binary low-density parity-check (LDPC) codes simply involves replacing a small number of the values in an all-zeros matrix by 1s in such a way that the rows and columns have the required degree distribution. In many cases, randomly allocating the entries in H will produce a reasonable LDPC code. However, the construction of H can affect the performance of the sum–product decoder, significantly so for some codes, and also the implementation complexity of the code.

Cambridge University Press eBooks•Nov 19, 2009•0 citations

A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)

Stanislav Kruglik, Valeriya Potapova, Alexey Frolov

Abstract An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.

arXiv:1705.10717•Journal of Communications Technology and Electronics•Dec 1, 2018•2 citations

Parallel Symbol-Flipping Decoding for Non-Binary LDPC Codes

Chao-Cheng Huang, Chi‐Jen Wu, Chao‐Yu Chen +1 more

A new low-complexity parallel symbol-flipping decoding algorithm for non-binary low-density parity-check (NB-LDPC) codes is proposed. The algorithm outperforms quite a number of existing reliability-based message-passing algorithms, and its computation complexity is smaller than that of almost all the previously proposed iterative decoding algorithms for NB-LDPC codes. It is suitable for decoding NB-LDPC codes whose parity-check matrices have large column weights.

IEEE Communications Letters•Jun 1, 2013•25 citations

Extended construction of array‐based non‐binary LDPC codes

Shancheng Zhao, Xiao Ma

Array‐based non‐binary (NB) low‐density parity‐check (LDPC) codes are attractive in practice for their advantages in implementation and performance. However, existing construction of array‐based NB LDPC codes is only with the prime number cases. In this Letter, the authors extend the array‐based construction to composite numbers to give an explicit construction of structured array‐based NB LDPC codes with column weights three, four, and five. The resulting codes have girth at least six. The simulation results show that the proposed structured codes perform as well as the random codes constructed by progressive edge‐growth algorithm, when decoded with the Q‐ary sum product algorithm and the low‐complexity weighted bit‐reliability‐based decoding algorithm.

Electronics Letters•Jan 9, 2019•7 citations
This paper presents a novel construction method for parity-check matrices of non-binary LDPC codes which selects nearly optimum non-zero elements in the parity-check matrices. The proposed method can improve the codeweight distribution of non-binary LDPC codes of column weight 2. The decoding performance of the non-binary LDPC codes using the parity-check matrices constructed by the proposed method can outperform that of the random method significantly.
A non-binary LDPC codes whose parity check matrix has uniform column weight 2 is constructed in this paper. The approach derives a non-binary LDPC codes from a column-weight 2 binary LDPC codes which is designed according to a all one (2, k) matrix, We proposed a search algorithm for constructing a (2, k) LDPC codes with desired girth, and in this paper, we use the search algorithm twice to obtain a code with larger girth. The simulation result shows that the proposed LDPC codes outperform the random codes.
In LDPC code, the structure of code's parity check matrix plays the crucial role in code performance. In this paper proposes the preliminary investigation of a designed parity check matrix from Tanner. We modify this technique in to non binary LDPC structure and decoding with FFT-SPA. We take into high code rate application more than 0.8. The result has shown that in bit error rate (BER) compare between non-binary LDPC and binary LDPC. In our results, the performance of non binary LDPC has better than binary LDPC.
Abstract An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.
Array‐based non‐binary (NB) low‐density parity‐check (LDPC) codes are attractive in practice for their advantages in implementation and performance. However, existing construction of array‐based NB LDPC codes is only with the prime number cases. In this Letter, the authors extend the array‐based construction to composite numbers to give an explicit construction of structured array‐based NB LDPC codes with column weights three, four, and five. The resulting codes have girth at least six. The simulation results show that the proposed structured codes perform as well as the random codes constructed by progressive edge‐growth algorithm, when decoded with the Q‐ary sum product algorithm and the low‐complexity weighted bit‐reliability‐based decoding algorithm.