.png){kind=icon}
.png){kind=icon}
Return
Tree-Permutation-Matrix Based LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCSII.2017.2785779.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Low-density parity-check (LDPC) codes are normally categorized into random structure or regular structure. In this brief, we introduce a new type of LDPC codes which is of semi-regular style. The parity-check matrices of the new LDPC code type are composed of sub-matrices termed tree-permutation matrices (TPMs). These TPMs are semi-regular and are constructed in a systematic way. Using the 2 x 2 identity matrix and anti-diagonal matrix as an example, we illustrate how 2(M) x 2(M ) TPMs are formed. During the formation of the 2(M) x 2(M) TPMs, we further apply the hill-climbing algorithm to avoid short cycles. Finally, we construct a girth-8 TPM-LDPC code with a base matrix of size 4 x 24 and a girth-10 TPM-LDPC code with a base matrix of size 3 x 10. We implement the TPM-LDPC decoders on an FPGA and compare the simulation results and decoder complexity with other LDPC codes.
Keywords:
FPGA implementation
low-density parity-check code
tree-permutation matrix
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W