Low-latency D-MIMO Localization using Distributed Scalable Message-Passing Algorithm

TL;DR

This paper introduces a scalable, distributed message-passing localization algorithm for D-MIMO systems that achieves low latency and high accuracy without centralized processing, suitable for future wireless networks.

Contribution

The paper presents a novel distributed localization method and system architecture that supports scalability, low latency, and dynamic scenarios in D-MIMO networks.

Findings

Achieves similar localization accuracy to multipath-based methods

Offers lower latency and computational complexity

Provides insights into hardware utilization and latency trade-offs

Abstract

Distributed MIMO and integrated sensing and communication are expected to be key technologies in future wireless systems, enabling reliable, low-latency communication and accurate localization. Dedicated localization solutions must support distributed architecture, provide scalability across different system configurations and meet strict latency requirements. We present a scalable message-passing localization method and architecture co-designed for a panel-based distributed MIMO system and network topology, in which interconnected units operate without centralized processing. This method jointly detects line-of-sight paths to distributed units from multipath measurements in dynamic scenarios, localizes the agent, and achieves very low latency. Additionally, we introduce a cycle-accurate system latency model based on implemented FPGA operations, and show important insights into processing latency and hardware utilization and system-level trade-offs. We compare our method to a multipath-based localization method and show that it can achieve similar localization performance, with wide enough distribution of array elements, while offering lower latency and computational complexity.