Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks

Fang, Borui; Chen, Li; Chen, Yunfei; Wang, Weidong

Abstract

Coded computation has attracted significant attention because it can eliminate the stragglers’ effect effectively. Most existing works of coded computation are designed for linear tasks, such as matrix multiplication. They cannot handle nonlinear tasks directly, leading to high computation, transmission and decoding latency. This is not suitable for latency-sensitive services. In this paper, considering a non-linear task in wireless heterogeneous networks, we propose an efficient merged-r Luby transform (LT) coded computation scheme based on the rateless and sparse LT code. First, we give the merged-r LT coding strategy to reduce the computation and transmission costs. Then, the maximum degree decoding (MDD) strategy is proposed to speed up the decoding process. Finally, we analyze the latency performance for the whole network by designing the optimal merging parameter and sub-block size. The wireless non-linear merged-r LT coded computation (WNLMrLTCC) algorithm minimizes the total latency. Theoretical analysis and numerical simulation show that our proposed scheme has significant advantages over the existing ones for non-linear tasks.

Citation

Fang, B., Chen, L., Chen, Y., & Wang, W. (in press). Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks. IEEE Transactions on Communications,

• Journal Article Type: Article
• Acceptance Date: Jan 6, 2025
• Deposit Date: Jan 10, 2025
• Journal: IEEE Transactions on Communications
• Print ISSN: 0090-6778
• Electronic ISSN: 1558-0857
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Public URL: https://durham-repository.worktribe.com/output/3329355
• Publisher URL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26