Name
Abstract | ||
|---|---|---|
Fulcrum decoders can trade off between computational complexity and the number of received packets. This allows heterogeneous nodes to decode at different level of complexity in accordance with their computing power. Variations of Fulcrum codes, like dynamic sparsity and expansion packets (DSEP) have significantly reduced the encoders and decoders\u0027 complexity by using dynamic sparsity and expansion packets. However, limited effort had been done for recoders of Fulcrum codes and their variations, limiting their full potential when being deployed at multi-hop networks. In this paper, we investigate the drawback of the conventional Fulcrum recoding and introduce a novel recoding scheme for the family of Fulcrum codes by limiting the buffer size, and thus memory needs. Our evaluations indicate that DSEP recoding mechamism increases the recoding goodput by 50%, and reduces the decoding overhead by 60%-90% while maintaining high decoding goodput at receivers and small memory usage at recoders compared with the conventional Fulcrum recoding. This further reduces the resources needed for Fulcrum codes at the recoders. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/GLOBECOM42002.2020.9348033 | GLOBECOM |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vu Nguyen | 1 | 134 | 18.35 |
| Juan A. Cabrera | 2 | 0 | 1.35 |
| Sreekrishna Pandi | 3 | 9 | 3.92 |
| Giang T. Nguyen | 4 | 2 | 0.72 |
| Frank H. P. Fitzek | 5 | 706 | 123.89 |