We consider the pilot assignment problem in large-scale distributed multi-input multi-output (MIMO) networks, where a large number of remote radio head (RRH) antennas are randomly distributed in a wide area, and jointly serve a relatively smaller number of users (UE) coherently. By artificially imposing structures on the UE-RRH connectivity, we model the network by a partially-connected interference network, so that the pilot assignment problem can be cast as a topological interference management problem with multiple groupcast messages. Building upon such connection, we formulate the topological pilot assignment (TPA) problem in two different ways with respect to whether or not the to-be-estimated channel connectivity pattern is known a priori . When it is known, we formulate the TPA problem as a low-rank matrix completion problem that can be solved by a simple alternating projection algorithm. Otherwise, we formulate it as a sequential maximum weight induced matching problem that can be solved by either a mixed integer linear program or a simple yet efficient greedy algorithm. With respect to two different formulations of the TPA problem, we evaluate the efficiency of the proposed algorithms under the cell-free massive MIMO setting.
24 February 2022 in IEEE Transactions on Wireless Communications
In this paper, we consider user selection and downlink precoding for an over-loaded single-cell massive multiple-input multiple-output (MIMO) system in frequency division duplexing (FDD) mode, where the base station is equipped with a dual-polarized uniform planar array (DP-UPA) and serves a large number of single-antenna users. Due to the absence of uplink-downlink channel reciprocity and the high-dimensionality of channel matrices, it is extremely challenging to design downlink precoders using closed-loop channel probing and feedback with limited spectrum resource. To address these issues, a novel methodology – active channel sparsification (ACS) – has been proposed recently in the literature for uniform linear array (ULA) to design sparsifying precoders, which substantially reduces channel feedback overhead. Pushing forward this line of research, we aim to facilitate the potential deployment of ACS in practical FDD massive MIMO systems, by extending it from ULA to DP-UPA with explicit user selection and making the current ACS implementation simplified. To this end, by leveraging Toeplitz matrix theory, we start with the spectral properties of channel covariance matrices from the lens of their matrix-valued spectral density function. Inspired by these properties, we extend the original ACS using scalar-weight bipartite graph representation to the matrix-weight counterpart. Building upon such matrix-weight bipartite graph representation, we propose a multi-dimensional ACS (MD-ACS) method, which is a generalization of original ACS formulation and is more suitable for DP-UPA antenna configurations. The nonlinear integer program formulation of MD-ACS can be classified as a generalized multi-assignment problem (GMAP), for which we propose a simple yet efficient greedy algorithm to solve it. Simulation results demonstrate the performance improvement of the proposed MD-ACS with greedy algorithm over the state-of-the-art methods based on the QuaDRiGa channel models.
16 April 2026 in IEEE Transactions on Wireless Communications
wireless communication environment may not experience direct line-of-sight propagation whereas the number of receivers (Rxs) is often limited. We propose the utilization of only non-line-of-sight (NLoS) received signal strength (RSS) measurements observed at a single Rx to locate a target, via a positioning algorithm accounting for data association ambiguity that may occur in a real-world scenario. Considering the stochastic nature of a network geometry, tractable expressions are derived for the probability of acquiring at least L NLoS RSS measurements during localization. In light of the computational complexity of our solution, we investigate the minimum number of RSS samples required to meet the specified localization accuracy, thereby guiding system design. Furthermore, the probability distribution of the trace of the Cramér-Rao lower bound is obtained analytically, which offers a comprehensive understanding of the fundamental limits of the single-Rx localization scheme without resorting to intensive simulations.
4 June 2026 in IEEE Journal on Selected Areas in Communications
In sixth-generation and beyond, space-air-ground integrated networks (SAGINs) extend network connectivity to space, thereby enabling broader service coverage. This paper proposes a topology-aware SAGIN framework to address the integrated sensing, communication, and wireless power transfer (ISCPT) problem, leveraging the distinctive visibility of satellite-terrestrial and satellite-satellite users as well as their constructing in-between channel strengths. By modeling the topology of the SAGIN as a bipartite graph, we formulate the ISCPT problem as a multi-objective joint optimization problem with specified topological structures to reflect connection relationships of satellite-terrestrial and satellite-satellite users. The ISCPT problem is then reformulated and carefully decomposed as several mixed-integer linear programs (MILPs) by leveraging the network topology to individually optimize sensing, communication, and power transfer. To reduce the computational complexity of the proposed method, a greedy algorithm deal with generalized multi-assignment problem (GMAP) is developed. Simulation results demonstrate superior performance in communication and sensing, with a tolerable trade-off in wireless power transfer.
We investigate the pilot assignment problem in dynamic distributed massive multiple-input multiple-output (DMIMO) systems, where a large number of access points (APs) are randomly distributed in a large cell and serve a smaller number of users in a coordinated manner. To save resources for channel estimation, a common practice is to consider only the channels with significant channel strengths between users and APs, whilst ignoring those negligible ones. This artificially imposes a graph structure on the network topology for pilot assignment. In a highly dynamic scenario with e.g., high-mobility users, however, the network topology may be varying over time, demanding frequent re-assignments of pilot sequences. In this paper, we consider a topological pilot assignment in a dynamic setting and propose a robust approach leveraging maximum distance separable (MDS) codes on graphs, such that pilots can be assigned once for all, regardless of the time-varying channel strengths. Simulation results of the downlink data rate performance in both static and dynamic DMIMO scenarios demonstrate the superior robustness of our proposed approach.
Multiple-input multiple-output (MIMO) is a technique that has been extensively studied and successfully implemented in various communication systems over the past few decades. It has been a key technology in both 4G and 5G mobile communication systems and will be a key enabler in 6G to support the extreme requirements of data rate, energy efficiency (EE), etc. However, meeting these requirements necessitates evolution in the architecture of massive MIMO systems, and distributed MIMO (D-MIMO) has garnered significant attention as a potential solution. This article articulates one of the key findings on adaptive large MIMO systems from the Hexa-X-II European 6G Flagship project and provides a vision of what large MIMO systems may entail in 6G. To achieve this, we examine an adaptive deployment strategy in a joint co-located and distributed MIMO setup, including the utilization of different carrier frequencies and coordinated transmission under an ideal channel state information assumption. We evaluate EE and data rate across various user densities. Additionally, we provide a framework to select the MIMO architecture based on user density and spatial distribution. The key challenges and future research directions on robust large MIMO systems towards realistic 6G networks are also discussed.