.png){kind=icon}
.png){kind=icon}
Return
On the Partial Decoding Delay of Sparse Network Coding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2018.2840139.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse network coding (SNC) is a promising technique for reducing the complexity of random linear network coding (RLNC), by selecting a sparse coefficient matrix to code the packets. However, the performance of SNC for the average decoding delay (ADD) of the packets is still unknown. We study the performance of ADD and propose a Markov chain model to analyze this SNC metric. This model provides a lower bound for decoding delay of a generation as well as a lower bound for decoding delay of a portion of a generation. Results show that although RLNC provides a better decoding delay of an entire generation, SNC outperforms RLNC in terms of ADD per packet. Sparsity of the coefficient matrix is a key parameter for ADD per packet to transmit stream data. The proposed model enables us to select the appropriate degree of sparsity based on the required ADD. Numerical results validate that the proposed model would enable a precise evaluation of SNC technique behavior.
Keywords:
Random linear network coding
sparse network coding
Markov chain model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available