Revolving Codes: Overhead and Computational Complexity Analysis

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

Dokumenter

  • paper

    312 KB, PDF-dokument

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.
OriginalsprogEngelsk
TidsskriftIEEE Communications Letters
ISSN1089-7798
StatusAccepteret/In press - 2020

Se relationer på Aarhus Universitet Citationsformater

Projekter

Download-statistik

Ingen data tilgængelig

ID: 196848132