Abstract:There is a demand for the same data content from several user equipments (UEs) in many wireless communication applications. Physical-layer multicasting combines the beamforming capability of massive MIMO (multiple-input multiple-output) and the broadcast nature of the wireless channel to efficiently deliver the same data to a group of UEs using a single transmission. This paper tackles the max-min fair (MMF) multicast beamforming optimization, which is an NP-hard problem. We develop an efficient semidefinite program-alternating direction method of multipliers (SDP-ADMM) algorithm to find the near-global optimal rank-1 solution to the MMF multicast problem in a massive MIMO system. Numerical results show that the proposed SDP-ADMM algorithm exhibits similar spectral efficiency performance to state-of-the-art algorithms running on standard SDP solvers at a vastly reduced computational complexity. We highlight that the proposed ADMM elimination procedure can be employed as an effective low-complexity rank reduction method for other problems utilizing semidefinite relaxation.
Abstract:Massive multiple-input multiple-output (mMIMO) has been the core of 5G due to its ability to improve spectral efficiency and spatial multiplexing significantly; however, cell-edge users still experience performance degradation due to inter-cell interference and uneven signal distribution. While cell-free mMIMO (cfmMIMO) addresses this issue by providing uniform coverage through distributed antennas, it requires significantly more deployment cost due to the fronthaul and tight synchronization requirements. Alternatively, repeater-assisted massive MIMO (RA-MIMO) has recently been proposed to extend the coverage of cellular mMIMO by densely deploying low-cost single-antenna repeaters capable of amplifying and forwarding signals. In this work, we investigate amplification control for the repeaters for two different goals: (i) providing a fair performance among users, and (ii) reducing the extra energy consumption by the deployed repeaters. We propose a max-min amplification control algorithm using the convex-concave procedure for fairness and a joint sleep mode and amplification control algorithm for energy efficiency, comparing long- and short-term strategies. Numerical results show that RA-MIMO, with maximum amplification, improves signal-to-interference-plus-noise ratio (SINR) by over 20 dB compared to mMIMO and performs within 1 dB of cfmMIMO when deploying the same number of repeaters as access points in cfmMIMO. Additionally, our majority-rule-based long-term sleep mechanism reduces repeater power consumption by 70% while maintaining less than 1% spectral efficiency outage.
Abstract:While fully digital precoding achieves superior performance in massive multiple-input multiple-output (MIMO) systems, it comes with significant drawbacks in terms of computational complexity and power consumption, particularly when operating at millimeter-wave frequencies and beyond. Hybrid analog-digital architectures address this by reducing radio frequency (RF) chains while maintaining performance in sparse multipath environments. However, most hybrid precoder designs assume ideal, infinite-resolution analog phase shifters, which cannot be implemented in actual systems. Another practical constraint is the limited fronthaul capacity between the baseband processor and array, implying that each entry of the digital precoder must be picked from a finite set of quantization labels. This paper proposes novel designs for the limited-resolution analog and digital precoders by exploiting two well-known MIMO symbol detection algorithms, namely sphere decoding (SD) and expectation propagation (EP). The goal is to minimize the Euclidean distance between the optimal fully digital precoder and the hybrid precoder to minimize the degradation caused by the finite resolution of the analog and digital precoders. Taking an alternative optimization approach, we first apply the SD method to find the precoders in each iteration optimally. Then, we apply the lower-complexity EP method which finds a near-optimal solution at a reduced computational cost. The effectiveness of the proposed designs is validated via numerical simulations, where we show that the proposed symbol detection-based precoder designs significantly outperform the nearest point mapping scheme which is commonly used for finding a sub-optimal solution to discrete optimization problems.
Abstract:We consider a cell-free massive multiple-input multiple-output (mMIMO) network, where unmanned aerial vehicles (UAVs) equipped with multiple antennas serve as distributed UAV-access points (UAV-APs). These UAV-APs provide seamless coverage by jointly serving user equipments (UEs) with out predefined cell boundaries. However, high-capacity wireless networks face significant challenges due to fronthaul limitations in UAV-assisted architectures. This letter proposes a novel UAV-based cell-free mMIMO framework that leverages distributed UAV-APs to serve UEs while addressing the capacity constraints of wireless fronthaul links. We evaluate functional split Options 7.2 and 8 for the fronthaul links, aiming to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among the UEs and minimize the power consumption by optimizing the transmit powers of UAV-APs and selectively activating them. Our analysis compares sub-6 GHz and millimeter wave (mmWave) bands for the fronthaul, showing that mmWave achieves superior SINR with lower power consumption, particularly under Option 8. Additionally, we determine the minimum fronthaul bandwidth required to activate a single UAV-AP under different split options.
Abstract:Massive multiple-input multiple-output (MIMO) systems exploit the spatial diversity achieved with an array of many antennas to perform spatial multiplexing of many users. Similar performance can be achieved using fewer antennas if movable antenna (MA) elements are used instead. MA-enabled arrays can dynamically change the antenna locations, mechanically or electrically, to achieve maximum spatial diversity for the current propagation conditions. However, optimizing the antenna locations for each channel realization is computationally excessive, requires channel knowledge for all conceivable locations, and requires rapid antenna movements, thus making real-time implementation cumbersome. To overcome these challenges, we propose a pre-optimized irregular array (PIA) concept, where the antenna locations at the base station are optimized a priori for a given coverage area. The objective is to maximize the average sum rate and we take a particle swarm optimization approach to solve it. Simulation results show that PIA achieves performance comparable to MA-enabled arrays while outperforming traditional uniform arrays. Hence, PIA offers a fixed yet efficient array deployment approach without the complexities associated with MA-enabled arrays.
Abstract:In vehicle-to-everything (V2X) applications, roadside units (RSUs) can be tasked with both sensing and communication functions to enable sensing-assisted communications. Recent studies have demonstrated that distance, angle, and velocity information obtained through sensing can be leveraged to reduce the overhead associated with communication beam tracking. In this work, we extend this concept to scenarios involving multiple distributed RSUs and distributed MIMO (multiple-input multiple-output) systems. We derive the state evolution model, formulate the extended Kalman-filter equations, and implement predictive beamforming for distributed MIMO. Simulation results indicate that, when compared with a co-located massive MIMO antenna array, distributed antennas lead to more uniform and robust sensing performance, coverage, and data rates, while the vehicular user is in motion.
Abstract:In massive MIMO systems, fully digital precoding offers high performance but has significant implementation complexity and energy consumption, particularly at millimeter frequencies and beyond. Hybrid analog-digital architectures provide a practical alternative by reducing the number of radio frequency (RF) chains while retaining performance in spatially sparse multipath scenarios. However, most hybrid precoder designs assume ideal, infinite-resolution analog phase shifters, which are impractical in real-world scenarios. Another practical constraint is the limited fronthaul capacity between the baseband processor and array, implying that each entry of the digital precoder must be picked from a finite set of quantization labels. To minimize the sum rate degradation caused by quantized analog and digital precoders, we propose novel designs inspired by the sphere decoding (SD) algorithm. We demonstrate numerically that our proposed designs outperform traditional methods, ensuring minimal sum rate loss in hybrid precoding systems with low-resolution phase shifters and limited fronthaul capacity.
Abstract:Federated Learning (FL) enables clients to share learning parameters instead of local data, reducing communication overhead. Traditional wireless networks face latency challenges with FL. In contrast, Cell-Free Massive MIMO (CFmMIMO) can serve multiple clients on shared resources, boosting spectral efficiency and reducing latency for large-scale FL. However, clients' communication resource limitations can hinder the completion of the FL training. To address this challenge, we propose an energy-efficient, low-latency FL framework featuring optimized uplink power allocation for seamless client-server collaboration. Our framework employs an adaptive quantization scheme, dynamically adjusting bit allocation for local gradient updates to reduce communication costs. We formulate a joint optimization problem covering FL model updates, local iterations, and power allocation, solved using sequential quadratic programming (SQP) to balance energy and latency. Additionally, clients use the AdaDelta method for local FL model updates, enhancing local model convergence compared to standard SGD, and we provide a comprehensive analysis of FL convergence with AdaDelta local updates. Numerical results show that, within the same energy and latency budgets, our power allocation scheme outperforms the Dinkelbach and max-sum rate methods by increasing the test accuracy up to $7$\% and $19$\%, respectively. Moreover, for the three power allocation methods, our proposed quantization scheme outperforms AQUILA and LAQ by increasing test accuracy by up to $36$\% and $35$\%, respectively.
Abstract:Holographic multiple-input multiple-output (MIMO) systems represent a spatially constrained MIMO architecture with a massive number of antennas with small antenna spacing as a close approximation of a spatially continuous electromagnetic aperture. Accurate channel modeling is essential for realizing the full potential of this technology. In this paper, we investigate the impact of mutual coupling and spatial channel correlation on the estimation precision in holographic MIMO systems, as well as the importance of knowing their characteristics. We demonstrate that neglecting mutual coupling can lead to significant performance degradation for the minimum mean squared error estimator, emphasizing its critical consideration when designing estimation algorithms. Conversely, the least-squares estimator is resilient to mutual coupling but only yields good performance in high signal-to-noise ratio regimes. Our findings provide insights into how to design efficient estimation algorithms in holographic MIMO systems, aiding its practical implementation.
Abstract:Physical layer multicasting is an efficient transmission technique that exploits the beamforming potential at the transmitting nodes and the broadcast nature of the wireless channel, together with the demand for the same content from several UEs. This paper addresses the max-min fair multigroup multicast beamforming optimization, which is an NP-hard problem. We propose a novel iterative elimination procedure coupled with semidefinite relaxation (SDR) to find the near-global optimum rank-1 beamforming vectors in a cell-free massive MIMO (multiple-input multiple-output) network setup. The proposed optimization procedure shows significant improvements in computational complexity and spectral efficiency performance compared to the SDR followed by the commonly used randomization procedure and the state-of-the-art difference-of-convex approximation algorithm. The significance of the proposed procedure is that it can be utilized as a rank reduction method for any problem in conjunction with SDR.