Revolving Codes: Overhead and Computational Complexity Analysis

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

158 Downloads (Pure)

Abstract

Revolving codes (ReC) are a new family of network codes that reduce signaling 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(g) where g 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.

Original languageEnglish
Article number9210058
JournalIEEE Communications Letters
Volume25
Issue2
Pages (from-to)374-378
Number of pages5
ISSN1089-7798
DOIs
Publication statusPublished - Feb 2021

Keywords

  • Network coding
  • complexity
  • overhead

Fingerprint

Dive into the research topics of 'Revolving Codes: Overhead and Computational Complexity Analysis'. Together they form a unique fingerprint.

Cite this