Name
Abstract | ||
|---|---|---|
Low-density parity-check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low-latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1049/iet-com.2017.0873 | IET Communications |
Keywords | Field | DocType |
computational complexity,decoding,parity check codes,telecommunication network reliability,telecommunication scheduling | Wireless,Latency (engineering),Low-density parity-check code,Word error rate,Real-time computing,Decoding methods,Dynamic priority scheduling,Computer engineering,Ldpc decoding,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
12 | 9 | 1751-8628 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cornelius T. Healy | 1 | 94 | 8.96 |
| Zhichao Shao | 2 | 8 | 3.58 |
| Robert M. Oliveira | 3 | 4 | 2.15 |
| Rodrigo C. de Lamare | 4 | 1461 | 179.59 |
| Luciano L. Mendes | 5 | 1 | 0.35 |