2011 IEEE Workshop on Signal Processing Systems (SiPS) 2011
DOI: 10.1109/sips.2011.6088997
|View full text |Cite
|
Sign up to set email alerts
|

An encoding scheme and encoder architecture for rate-compatible QC-LDPC codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…p1 and p2 computational complexity The inverse of the matrix in the equation of p 1 T is not a sparse matrix, thus the computational complexity of the encoder is high. The LDPC decoder operates in linear time, hence it may be difficult to perform low-complexity encoding of these codes [11]. S. Myung et al , in their paper proposed an encoding algorithm for LDPC codes with linearly scaled complexity, based on the principal to choose the matrix φ as the identity matrix or a circulant permutation matrix [26].The encoding procedure of Block-LDPCs is simplified and summarized in equation 10-14 as follows [5].…”
Section: A B T H =mentioning
confidence: 99%
“…p1 and p2 computational complexity The inverse of the matrix in the equation of p 1 T is not a sparse matrix, thus the computational complexity of the encoder is high. The LDPC decoder operates in linear time, hence it may be difficult to perform low-complexity encoding of these codes [11]. S. Myung et al , in their paper proposed an encoding algorithm for LDPC codes with linearly scaled complexity, based on the principal to choose the matrix φ as the identity matrix or a circulant permutation matrix [26].The encoding procedure of Block-LDPCs is simplified and summarized in equation 10-14 as follows [5].…”
Section: A B T H =mentioning
confidence: 99%
“…2, p(1) and p(N-M-1) can be computed by p 1 (0) + λ 0 and p 1 (0) + λ N-M-1 , respectively. The other sub-sequences of the parity bits can be obtained by the forward and backward accumulators according to (10) and (11), respectively. Fig.…”
Section: Proposed High Throughput Encoder Corementioning
confidence: 99%
“…In many literatures, the encoders for QC-LDPC codes were presented [4][5][6][7][8][9][10][11][12][13]. The LDPC encoders presented in [4,5,[7][8][9][10][11] can support various code rates and codeword block lengths. However, these encoders cannot support the high data rate over Gbps.…”
Section: Introductionmentioning
confidence: 99%
“…In general, while the LDPC decoder can operate in linear time, it may be hard to perform low-complexity encoding of these codes [8].…”
Section: Ii-b Encoding Algorithmmentioning
confidence: 99%