We provide novel coded computation strategies for distributed matrix–matrix products that outperform the recent “Polynomial code” constructions in recovery threshold, i.e., the required number of successful workers. When a fixed $1/m$ fraction of each matrix can be stored at each worker node, Polynomial codes require $m^{2}$ successful workers, while our MatDot codes only require $2m-1$ successful workers. However, MatDot codes have higher computation cost per worker and higher communication cost from each worker to the fusion node. We also provide a systematic construction of MatDot codes. Furthermore, we propose “PolyDot” coding that interpolates between Polynomial codes and MatDot codes to trade off computation/communication costs and recovery thresholds. Finally, we demonstrate a novel coding technique for multiplying $n$ matrices ( $n \geq 3$ ) using ideas from MatDot and PolyDot codes.
11 January 2021 in IEEE Transactions on Information Theory
We study the numerical stability of polynomial based encoding methods, which has emerged to be a powerful class of techniques for providing straggler and fault tolerance in the area of coded computing. Our contributions are as follows: 1)We construct new codes for matrix multiplication that achieve the same fault/straggler tolerance as the previously constructed MatDot Codes and Polynomial Codes.2)We show that the condition number of every m ×m sub-matrix of an m ×n, n ≥ m Chebyshev-Vandermonde matrix, evaluated on the n-point Chebyshev grid, grows as O(n 2(n-m) ) for n > m.3)By specializing our orthogonal polynomial based constructions to Chebyshev polynomials, and using our condition number bound for Chebyshev-Vandermonde matrices, we construct new numerically stable techniques for coded matrix multiplication. We empirically demonstrate that our constructions have significantly lower numerical errors compared to previous approaches which involve inversion of Vandermonde matrices. We generalize our constructions to explore the trade-off between computation/communication and fault-tolerance.4)We propose a numerically stable specialization of Lagrange coded computing. Our approach involves the choice of evaluation points and a suitable decoding procedure. Our approach is demonstrated empirically to have lower numerical errors as compared to standard methods.
Digital Twin (DT) technology has recently emerged as a powerful tool with the potential to revolutionize wireless systems as it enables accurate simulations, better decision-making, and tangible operational improvements. Prior studies on DT within the context of next generation wireless technologies have primarily focused on identifying potential use cases, application scenarios, standardization challenges, and conceptual implementation steps. However, the existing research is limited in translating theoretical ideas into real-world applications. Our research, in this paper, contributes to the practical realization of DT technology in the context of 6G wireless networks, demonstrating its potential impact on network planning, performance, and user experience. In particular, we explore the construction, validation, and applications of DT utilizing an indoor over-the-air (OTA) 5G NR testbed powered by an in-house developed Next Generation Radio Access Network (NG-RAN) that is fully compliant with 3rd Generation Partnership Project (3GPP) and Open RAN standards. First, we explain the integration and implementation steps followed to integrate Qualcomm Edgewise™ Suite and Service Management and Orchestration (SMO) tools into the NG-RAN architecture, that will eventually enable the applicability of DT for wireless network operations. We then describe our procedure to construct and validate a high-fidelity DT of our OTA testbed modeling both Radio Frequency (RF) environment and system components. We demonstrate two pre-deployment use cases by describing our extensive coverage estimation and network capacity planning tests in OTA. Lastly, we explore how DT enables practical machine learning solutions for post-deployment use cases and share our comprehensive OTA performance results, highlighting that our proposed mobility and positioning techniques outperform the classical approaches in terms of throughput, number of undesired handovers, and positioning accuracy.