2016 IEEE 83rd Vehicular Technology Conference (VTC Spring) 2016
DOI: 10.1109/vtcspring.2016.7504085
|View full text |Cite
|
Sign up to set email alerts
|

A New Architecture for High Speed, Low Latency NB-LDPC Check Node Processing for GF(256)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…In [59], finite-length NB protographbased (NBPB) LDPC codes are proposed, which choose the edge weights and show coding gains in about 256 bits of code length. In [60], NB-LDPC codes in a field of GF(256) have a parallel decoding structure and greatly reduce decoding latency. As rateless codes, LT codes and Raptor codes [61] show flexibility in error controlling capability and are used in multimedia dissemination.…”
Section: ) Advances Of Codes For Hrll Communicationsmentioning
confidence: 99%
“…In [59], finite-length NB protographbased (NBPB) LDPC codes are proposed, which choose the edge weights and show coding gains in about 256 bits of code length. In [60], NB-LDPC codes in a field of GF(256) have a parallel decoding structure and greatly reduce decoding latency. As rateless codes, LT codes and Raptor codes [61] show flexibility in error controlling capability and are used in multimedia dissemination.…”
Section: ) Advances Of Codes For Hrll Communicationsmentioning
confidence: 99%
“…Thus, removing the RE process from the ECN processing avoids performance degradation. Let us define a modified ECN operation with symbol ⊞ ′ where the ECN addition is performed as in (12) and no RE is performed. The syndrome set of size n m can then be computed as…”
Section: A Syndrome Computation Using the Ef Processingmentioning
confidence: 99%
“…The throughput of a layered decoder is given by T = (N b × F clk × p)/(M × CL(layer) × it avr ) where it avr is the average number of iterations and F clk is fixed at 800 MHz. The layered GF(64) (1536, 1344) code allows different parallelism options depending on the splitting factor [28] (p = 2, 3,4,6,8,12,16,24,32,48,96). With an observed average number of iterations at SNR = 4.0 of 1.5 and a parallelism of 12, the throughput can reach 1.2 Gbps with p = 2 and 7.3 Gbps with p = 12.…”
Section: E Throughputmentioning
confidence: 99%
See 1 more Smart Citation
“…Although NB-LDPC codes provide a better error rate performance compared to binary LDPC codes, the high computation and storage complexity required by high-order NB-LDPC decoders limits its practical usage [13]. In order to reduce the complexity of the decoder, the extended Min-Sum (EMS) algorithm [14]- [16], the Min-Max algorithm [17]- [20] and a syndrome-based check node (SYN CN) algorithm [21] [22] are proposed. It was demonstrated in [23] that, compared to the Min-Max algorithm, the EMS algorithm is able to achieve a better error-rate performance and, hence, is considered in this paper.…”
Section: Introductionmentioning
confidence: 99%