2019
DOI: 10.1109/tcsi.2018.2884252
|View full text |Cite
|
Sign up to set email alerts
|

Layered LDPC Decoders With Efficient Memory Access Scheduling and Mapping and Built-In Support for Pipeline Hazards Mitigation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 25 publications
0
13
0
Order By: Relevance
“…However, this results in the loss of the gain generated by the corresponding check node, which cannot positively impact subsequent iterations. Referring to formula (8), many references [15,16,18] suggest that, in such instances, the corresponding gain can be calculated and stored in the corresponding memory space. The gain will not be read and stacked until the LLR is updated at the same position.…”
Section: Patch Methods Based On Variable-to-check Messagementioning
confidence: 99%
See 2 more Smart Citations
“…However, this results in the loss of the gain generated by the corresponding check node, which cannot positively impact subsequent iterations. Referring to formula (8), many references [15,16,18] suggest that, in such instances, the corresponding gain can be calculated and stored in the corresponding memory space. The gain will not be read and stacked until the LLR is updated at the same position.…”
Section: Patch Methods Based On Variable-to-check Messagementioning
confidence: 99%
“…However, this approach incurs a significant performance loss compared to the theoretical layered decoding algorithm, necessitating more iterations. Similarly, the residue-based layered schedule [16] continuously accumulates and stores the contributions in registers when pipeline conflicts arise, adding them to the corresponding LLRs at the end of the pipeline problem. [17] proposes to split the matrix for the LDPC codes in the DVB-T2 protocol, which can reduce the degree of parallelism and significantly reduce the number of conflicts.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Layered Normalized Min-Sum Algorithm (LNMSA) [8] is one of the most commonly used QC-LDPC soft-decision decoding algorithms. The initial input of decoding is a Loglikelihood Ratio (LLR) value that represents channel's soft message.…”
Section: Layered Normalized Min-sum Algorithmmentioning
confidence: 99%
“…The routing network is implemented with the help of barrel shifters, where, the shift factors are stored in a memory. The authors in [ 11 ] have implemented pipelined layered decoder architecture for QC-LDPC codes. A high throughput is achieved by implementing a flexible partially parallel decoder supporting different parallelism factors and a routing network supporting different matrices.…”
Section: Introductionmentioning
confidence: 99%