Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay
Andrew Liau, Il‐Min Kim, Shahram Yousefi · IEEE Transactions on Communications · 2013
In this paper, we examine the marriage of Fountain coding and network coding (NC). Fountain codes are capacity achieving erasure codes designed for point-to-point transmissions. NC is a throughput-optimal data dissemination technique, but its high-complexity decoding makes it unattractive for applications where limited resources are available. In this paper, we consider Fountain network coding to take advantage of efficient fountain decoders. Protocols such as Soliton-like rateless coding (SLRC) have previously addressed this issue, yet the re-encoding at the relay is expensive while there is still room for improving the performance. Extending SLRC, we propose the Improved Soliton-like Rateless Coding (ISLRC) protocol, where the relay is designed to perform distribution shaping given limited resources. ISLRC preserves the same properties as SLRC, but also makes the aggregate degree distribution more efficient for Fountain decoding. We analyze ISLRC's degree distribution and perform an asymptotic error analysis for the case where resources are most scarce. The ISLRC scheme is compared against other existing schemes. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.