2017
DOI: 10.1049/iet-com.2017.0092
|View full text |Cite
|
Sign up to set email alerts
|

A new two‐stage decoding scheme with unreliable path search to lower the error‐floor for low‐density parity‐check codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 16 publications
0
0
0
Order By: Relevance
“…The MSA algorithm, a simplified form of the LLR-BP algorithm, performs the following simplification during the check nodes update [22][23][24][25][26][27][28][29][30][31][32]:…”
Section: Min-sum Algorithm(msa)mentioning
confidence: 99%
See 1 more Smart Citation
“…The MSA algorithm, a simplified form of the LLR-BP algorithm, performs the following simplification during the check nodes update [22][23][24][25][26][27][28][29][30][31][32]:…”
Section: Min-sum Algorithm(msa)mentioning
confidence: 99%
“…By using the ping-pong operation, not only can data be seamlessly and continuously processed, but storage space can also be saved, and hardware implementation is easy. The coder structure (Figure 5) designed and implemented using the high-efficiency and low-complexity coding algorithm comprises an input/output random access memory (RAM) module, vector adder (VA) module, matrix-vector multiplier (MVM) module, CW generator (CWG) module, cache module, forwarder replacer (FS) module, and control module [28][29][30][31][32][33][34][35].…”
Section: ② Matrix Multiplier (Mvm) Modulementioning
confidence: 99%