Revolving Codes: Overhead and Computational Complexity Analysis

TY - JOUR

T1 - Revolving Codes: Overhead and Computational Complexity Analysis

AU - Yazdani, Niloofar

AU - Lucani Rötter, Daniel Enrique

PY - 2021/2

Y1 - 2021/2

N2 - 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.

AB - 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.

KW - Network coding

KW - complexity

KW - overhead

UR - http://www.scopus.com/inward/record.url?scp=85101458685&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2020.3027875

DO - 10.1109/LCOMM.2020.3027875

M3 - Journal article

SN - 1089-7798

VL - 25

SP - 374

EP - 378

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 2

M1 - 9210058

ER -