7th IEEE International Conference on Computer and Information Technology (CIT 2007) 2007
DOI: 10.1109/cit.2007.7
|View full text |Cite
|
Sign up to set email alerts
|

Overview of LDPC Codes

Abstract: In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph. The encoding of LDPC codes comprises two tasks: construct a sparse parity-check matrix, and generate codewords with the matrix. The decoding of LDPC codes can be divided into three phases: initialization… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…It could be represented in two manners: either in parity check matrix H or using tanner graph, which is simply bipartite graphs, used to express LDPC in a graph representation. Two types of nodes in the Tanner graph: variable nodes, which define a single column in the parity-check matrix, as well as check nodes, which define a single row in the parity-check matrix [11]. The sparsity of the H matrix means that there is less number of 1's than zeros, which will help LDPC codes expand in the smallest amount of space.…”
Section: Types and Representation Of Ldpcmentioning
confidence: 99%
See 1 more Smart Citation
“…It could be represented in two manners: either in parity check matrix H or using tanner graph, which is simply bipartite graphs, used to express LDPC in a graph representation. Two types of nodes in the Tanner graph: variable nodes, which define a single column in the parity-check matrix, as well as check nodes, which define a single row in the parity-check matrix [11]. The sparsity of the H matrix means that there is less number of 1's than zeros, which will help LDPC codes expand in the smallest amount of space.…”
Section: Types and Representation Of Ldpcmentioning
confidence: 99%
“…Type of LDPC used and purpose of implementation. Whether to improve performance, reduce complexity, increase throughput, and so on, such as the following [1]- [3], [11], [15], [17]- [21] conducted a comprehensive survey on LDPC code encoding and decoding techniques (in both academic and industry).…”
Section: Related Workmentioning
confidence: 99%
“…Due to the limited characteristics of computers at that times, this class of linear code was absent till 1990s where they have been reinvented through the Macky and Neal works, its has been shown that LDPC codes performance is near to Shannon limit performance with belief propagation algorithm (BPA) [4]. There are characteristics that distinguish LDPC codes from Turbo codes, such as superior performance when the block length is large, enormous flexibility, easy description and subsequent theoretical venerability, decreased decoding complexity, and so on [5].…”
Section: Related Work 21 Low Density Parity Check Codesmentioning
confidence: 99%