-
Uddannelse
Find uddannelse
Studievejledning
Kvalitet
- Forskning
-
Samarbejde
Virksomheder
Kommuner og regioner
Gymnasier
Myndigheder
-
Om AU
Organisation
Kontakt
Om AU
- Organisation
- Ledelse
- Strategi
- AU i tal
- AU's historie
- Internationalt samarbejde
- Bæredygtighed
- Campus 2.0
- Diversitet og ligestilling
- Ledige stillinger
- Presse
- Kontakt
Revolving Codes: Overhead and Computational Complexity Analysis
Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
Dokumenter
- paper
312 KB, PDF-dokument
DOI
- https://doi.org/10.1109/LCOMM.2020.3027875
Forlagets udgivne version
- Niloofar Yazdani ,
- Daniel Enrique Lucani Rötter
Revolving codes (ReC) are a new family of network codes that reduce signalling overhead and maintain high decoding probability, which is key in applications with small payloads, e.g., IoT, Industry 4.0. However, they have only been studied using simulations. We present i) the first exact mathematical model for the total overhead and decoding probability of a set of ReCs, and ii) efficient encoders and decoders. Our analysis shows that ReC decoders’ number of multiplications scales as O(n) where n is the number of data packets being combined. In practice, this translates in several orders of magnitude fewer multiplications, half the number of additions, and lower transmission overheads compared to RLNC.
| Originalsprog | Engelsk |
|---|---|
| Artikelnummer | 9210058 |
| Tidsskrift | IEEE Communications Letters |
| Vol/bind | 25 |
| Nummer | 2 |
| Sider (fra-til) | 374-378 |
| Antal sider | 5 |
| ISSN | 1089-7798 |
| DOI | |
| Status | Udgivet - feb. 2021 |
Se relationer på Aarhus Universitet Citationsformater
Projekter
Download-statistik
Ingen data tilgængelig
ID: 196848132