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 Recent Trends in Engineering and Research

REVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE

Published Apr 5, 2017• 2 citations
Publisher
DOI
10.23883/ijrter.2017.3096.ojhls

Related papers

A NEW CONSTRUCTION METHOD FOR LOW-DENSITY PARITY-CHECK CODES

Mahmoud Rashidpour, Javad Haghighat, Jamali S.H.R. +1 more

•Jan 1, 2003•0 citations

CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE

Prashantha Kumar H, Udupi Sripati, Rajesh Shetty K

Low density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.

ICTACT Journal on Communication Technology•Sep 1, 2011•0 citations

Parity check matrix generation for (3, k)-regular LDPC codes

Manju Choudhary

•Nov 28, 2012•0 citations

Improved Performance Analysis of LDPC Codes Based on a New Parity Check Matrix Construction

Yu Yi, Hye Kyung Jang, Moon Ho Lee +1 more

한국통신학회 학술대회논문집•Jul 1, 2002•0 citations

ANALYSIS OF METHODS OF CONSTRUCTION AND ENCODING LOW-DENSITY PARITY CHECK CODES

Alexey Stanyslavovych Volkov, Stanislav Sergeevich Zhuchenko

The article analyzes the famous methods of construction and representations of the check matrix block and convolutional codes with low-density parity-check. The analysis the famous methods of coding block and convolutional codes with low-density parity-check. Showed advantages and disadvantages of the known methods and allowed to identify and formulate a scientific and technical challenge. Shows the method of representation of the check matrix block codes with low-density parity-check using the Tanner graph, which like the check matrix is fully defines the parameters of the code. Check matrix of convolutional codes with low-density parity-check can also be described by Tanner graph, however, because the check matrix is infinite, then the Tanner graph is infinite. The analysis method of constructing the parity check matrix of block codes with low-density parity-check, which is based on a shortened Reed-Solomon code. Codes constructed in this method have a Tanner graph girth at least 6, which allows them to effectively use iterative decoding methods.

Collected scientific works of Ukrainian State University of Railway Transport•Dec 22, 2014•0 citations

A LDPC Parity Check Matrix Construction for Parallel Hardware Decoding

François S. Verdier, David Declercq

•Sep 1, 2003•10 citations
Low density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.
The article analyzes the famous methods of construction and representations of the check matrix block and convolutional codes with low-density parity-check. The analysis the famous methods of coding block and convolutional codes with low-density parity-check. Showed advantages and disadvantages of the known methods and allowed to identify and formulate a scientific and technical challenge. Shows the method of representation of the check matrix block codes with low-density parity-check using the Tanner graph, which like the check matrix is fully defines the parameters of the code. Check matrix of convolutional codes with low-density parity-check can also be described by Tanner graph, however, because the check matrix is infinite, then the Tanner graph is infinite. The analysis method of constructing the parity check matrix of block codes with low-density parity-check, which is based on a shortened Reed-Solomon code. Codes constructed in this method have a Tanner graph girth at least 6, which allows them to effectively use iterative decoding methods.