Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction
- 2 Definitions, Concepts, and Fundamental Characteristics of LDPC Codes
- 3 A Review of PTG-Based Construction of LDPC Codes
- 4 An Algebraic Method for Constructing QC-PTG-LDPC Codes and Code Ensembles
- 5 Superposition Construction of LDPC Codes
- 6 Construction of Base Matrices and RC-Constrained Replacement Sets for SP-Construction
- 7 SP-Construction of QC-LDPC Codes Using Matrix Dispersion and Masking
- 8 Doubly QC-LDPC Codes
- 9 SP-Construction of Spatially Coupled QC-LDPC Codes
- 10 Globally Coupled QC-LDPC Codes
- 11 SP-Construction of Nonbinary LDPC Codes
- 12 Conclusion and Remarks
- Appendices
- References
- Index
9 - SP-Construction of Spatially Coupled QC-LDPC Codes
Published online by Cambridge University Press: 15 December 2016
- Frontmatter
- Contents
- Preface
- 1 Introduction
- 2 Definitions, Concepts, and Fundamental Characteristics of LDPC Codes
- 3 A Review of PTG-Based Construction of LDPC Codes
- 4 An Algebraic Method for Constructing QC-PTG-LDPC Codes and Code Ensembles
- 5 Superposition Construction of LDPC Codes
- 6 Construction of Base Matrices and RC-Constrained Replacement Sets for SP-Construction
- 7 SP-Construction of QC-LDPC Codes Using Matrix Dispersion and Masking
- 8 Doubly QC-LDPC Codes
- 9 SP-Construction of Spatially Coupled QC-LDPC Codes
- 10 Globally Coupled QC-LDPC Codes
- 11 SP-Construction of Nonbinary LDPC Codes
- 12 Conclusion and Remarks
- Appendices
- References
- Index
Summary
In this chapter, we present an algebraic construction of a special type of LDPC code whose Tanner graph has a very specific structure. For an LDPC code of this type, its Tanner graph is locally connected. Every VN is only connected to the CNs that are confined to a (small) span of ρcol consecutive locations and every CN is only connected to VNs that are confined to a (small) span of ρrow consecutive locations. We call such constraints on the connections between VNs and CNs of a Tanner graph (ρcol,ρrow)-span-constraints. With this span-constraint, the Tanner graph of such an LDPC code is actually a chain of small Tanner graphs in which each graph is connected to its adjacent graphs on either side of it, except the first and the last ones. An LDPC code of this type is called a span-constrained LDPC code. The SC-LDPC code investigated in [59, 60, 22, 86] is a type of span-constrained LDPC code.
An SC-LDPC code is an LDPC convolutional (LDPC-C) code viewed from a graphical point of view (or a spatial coupling point of view) [49, 104, 66, 67, 92]. An LDPC-C code [49, 104] is specified by a bi-infinite parity-check matrix whose nonzero entries are confined to a diagonal band of a certain width ρrow and a certain depth ρcol. The nonzero entries in every row are confined to a span of ρrow consecutive locations and the nonzero entries in every column are confined to a span of ρcol consecutive locations. With these constraints on the locations of the nonzero entries of the parity-check matrix of an LDPC-C code, every VN in its Tanner graph is only connected to the CNs that are confined to a span of ρcol consecutive locations and every CN is only connected to VNs that are confined to a span of ρrow consecutive locations. These constraints on the locations of the nonzero entries of the parity-check matrix of an LDPC-C code lead to the graphical (ρcol,ρrow)-span-constraint as mentioned above. Hence, an LDPC-C code is a span-constrained LDPC code, an SC-LDPC code.
- Type
- Chapter
- Information
- LDPC Code Designs, Constructions, and Unification , pp. 111 - 137Publisher: Cambridge University PressPrint publication year: 2016