Mobility-Aware Joint User Scheduling and Resource Allocation for Low Latency Federated Learning

As an efficient distributed machine learning approach, Federated learning (FL) can obtain a shared model by iterative local model training at the user side and global model aggregating at the central server side, thereby protecting privacy of users. Mobile users in FL systems typically communicate with base stations (BSs) via wireless channels, where training performance could be degraded due to unreliable access caused by user mobility. However, existing work only investigates a static scenario or random initialization of user locations, which fail to capture mobility in real-world networks. To tackle this issue, we propose a practical model for user mobility in FL across multiple BSs, and develop a user scheduling and resource allocation method to minimize the training delay with constrained communication resources. Specifically, we first formulate an optimization problem with user mobility that jointly considers user selection, BS assignment to users, and bandwidth allocation to minimize the latency in each communication round. This optimization problem turned out to be NP-hard and we proposed a delay-aware greedy search algorithm (DAGSA) to solve it. Simulation results show that the proposed algorithm achieves better performance than the state-of-the-art baselines and a certain level of user mobility could improve training performance.

Intelligent Reflecting Surface Assisted Localization: Performance Analysis and Algorithm Design

The target sensing/localization performance is fundamentally limited by the line-of-sight link and severe signal attenuation over long distances. This paper considers a challenging scenario where the direct link between the base station (BS) and the target is blocked due to the surrounding blockages and leverages the intelligent reflecting surface (IRS) with some active sensors, termed as \textit{semi-passive IRS}, for localization. To be specific, the active sensors receive echo signals reflected by the target and apply signal processing techniques to estimate the target location. We consider the joint time-of-arrival (ToA) and direction-of-arrival (DoA) estimation for localization and derive the corresponding Cram\'{e}r-Rao bound (CRB), and then a simple ToA/DoA estimator without iteration is proposed. In particular, the relationships of the CRB for ToA/DoA with the number of frames for IRS beam adjustments, number of IRS reflecting elements, and number of sensors are theoretically analyzed and demystified. Simulation results show that the proposed semi-passive IRS architecture provides sub-meter level positioning accuracy even over a long localization range from the BS to the target and also demonstrate a significant localization accuracy improvement compared to the fully passive IRS architecture.

Recursive LMMSE-Based Iterative Soft Interference Cancellation for MIMO Systems to Save Computations and Memories

Firstly, a reordered description is given for the linear minimum mean square error (LMMSE)-based iterative soft interference cancellation (ISIC) detection process for Mutipleinput multiple-output (MIMO) wireless communication systems, which is based on the equivalent channel matrix. Then the above reordered description is applied to compare the detection process for LMMSE-ISIC with that for the hard decision (HD)-based ordered successive interference cancellation (OSIC) scheme, to draw the conclusion that the former is the extension of the latter. Finally, the recursive scheme for HD-OSIC with reduced complexity and memory saving is extended to propose the recursive scheme for LMMSE-ISIC, where the required computations and memories are reduced by computing the filtering bias and the estimate from the Hermitian inverse matrix and the symbol estimate vector, and updating the Hermitian inverse matrix and the symbol estimate vector efficiently. Assume N transmitters and M (no less than N) receivers in the MIMO system. Compared to the existing low-complexity LMMSE-ISIC scheme, the proposed recursive LMMSE-ISIC scheme requires no more than 1/6 computations and no more than 1/5 memory units.

Intelligent Omni Surfaces assisted Integrated Multi Target Sensing and Multi User MIMO Communications

Drawing inspiration from the advantages of intelligent reflecting surfaces (IRS) in wireless networks,this paper presents a novel design for intelligent omni surface (IOS) enabled integrated sensing and communications (ISAC). By harnessing the power of multi antennas and a multitude of elements, the dual-function base station (BS) and IOS collaborate to realize joint active and passive beamforming, enabling seamless 360-degree ISAC coverage. The objective is to maximize the minimum signal-tointerference-plus-noise ratio (SINR) of multi-target sensing, while ensuring the multi-user multi-stream communications. To achieve this, a comprehensive optimization approach is employed, encompassing the design of radar receive vector, transmit beamforming matrix, and IOS transmissive and reflective coefficients. Due to the non-convex nature of the formulated problem, an auxiliary variable is introduced to transform it into a more tractable form. Consequently, the problem is decomposed into three subproblems based on the block coordinate descent algorithm. Semidefinite relaxation and successive convex approximation methods are leveraged to convert the sub-problem into a convex problem, while the iterative rank minimization algorithm and penalty function method ensure the equivalence. Furthermore,the scenario is extended to mode switching and time switching protocols. Simulation results validate the convergence and superior performance of the proposed algorithm compared to other benchmark algorithms.

Performance Analysis of RIS-Aided Space Shift Keying With Channel Estimation Errors

In this paper, we investigate the reconfigurable intelligent surface (RIS) assisted space shift keying (SSK) downlink communication systems under the imperfect channel state information (CSI), where the channel between the base station to RIS follows the Rayleigh fading, while the channel between the RIS to user equipment obeys the Rician fading. Based on the maximum likelihood detector, the conditional pairwise error probability of the composite channel is derived. Then, the probability density function for a non-central chi-square distribution with one degree of freedom is derived. Based on this, the closed-form analytical expression of the RIS-SSK scheme with imperfect CSI is derived. To gain more valuable insights, the asymptotic ABEP expression is also given. Finally, we validate the derived closed-form and asymptotic expressions by Monte Carlo simulations.

IRS-Aided Overloaded Multi-Antenna Systems: Joint User Grouping and Resource Allocation

This paper studies an intelligent reflecting surface (IRS)-aided multi-antenna simultaneous wireless information and power transfer (SWIPT) system where an $M$-antenna access point (AP) serves $K$ single-antenna information users (IUs) and $J$ single-antenna energy users (EUs) with the aid of an IRS with phase errors. We explicitly concentrate on overloaded scenarios where $K + J > M$ and $K \geq M$. Our goal is to maximize the minimum throughput among all the IUs by optimizing the allocation of resources (including time, transmit beamforming at the AP, and reflect beamforming at the IRS), while guaranteeing the minimum amount of harvested energy at each EU. Towards this goal, we propose two user grouping (UG) schemes, namely, the non-overlapping UG scheme and the overlapping UG scheme, where the difference lies in whether identical IUs can exist in multiple groups. Different IU groups are served in orthogonal time dimensions, while the IUs in the same group are served simultaneously with all the EUs via spatial multiplexing. The two problems corresponding to the two UG schemes are mixed-integer non-convex optimization problems and difficult to solve optimally. We propose efficient algorithms for these two problems based on the big-M formulation, the penalty method, the block coordinate descent, and the successive convex approximation. Simulation results show that: 1) the non-robust counterparts of the proposed robust designs are unsuitable for practical IRS-aided SWIPT systems with phase errors since the energy harvesting constraints cannot be satisfied; 2) the proposed UG strategies can significantly improve the max-min throughput over the benchmark schemes without UG or adopting random UG; 3) the overlapping UG scheme performs much better than its non-overlapping counterpart when the absolute difference between $K$ and $M$ is small and the EH constraints are not stringent.

Intelligent Reflecting Surface Assisted Multi-Cluster AirComp via Dynamic Beamforming

This paper studies an multi-cluster over-the-air computation (AirComp) system, where an intelligent reflecting surface (IRS) assists the signal transmission from devices to an access point (AP). The clusters are activated to compute heterogeneous functions in a time-division manner. Specifically, two types of IRS beamforming (BF) schemes are proposed to reveal the performancecost tradeoff. One is the cluster-adaptive BF scheme, where each BF pattern is dedicated to one cluster, and the other is the dynamic BF scheme, which is applied to any number of IRS BF patterns. By deeply exploiting their inherent properties, both generic and lowcomplexity algorithms are proposed in which the IRS BF patterns, time and power resource allocation are jointly optimized. Numerical results show that IRS can significantly enhance the function computation performance, and demonstrate that the dynamic IRS BF scheme with half of the total IRS BF patterns can achieve near-optimal performance which can be deemed as a cost-efficient approach for IRS-aided multi-cluster AirComp systems.

Intelligent Reflecting Surface Empowered Self-Interference Cancellation in Full-Duplex Systems

Compared with traditional half-duplex wireless systems, the application of emerging full-duplex (FD) technology can potentially double the system capacity theoretically. However, conventional techniques for suppressing self-interference (SI) adopted in FD systems require exceedingly high power consumption and expensive hardware. In this paper, we consider employing an intelligent reflecting surface (IRS) in the proximity of an FD base station (BS) to mitigate SI for simultaneously receiving data from uplink users and transmitting information to downlink users. The objective considered is to maximize the weighted sum-rate of the system by jointly optimizing the IRS phase shifts, the BS transmit beamformers, and the transmit power of the uplink users. To visualize the role of the IRS in SI cancellation by isolating other interference, we first study a simple scenario with one downlink user and one uplink user. To address the formulated non-convex problem, a low-complexity algorithm based on successive convex approximation is proposed. For the more general case considering multiple downlink and uplink users, an efficient alternating optimization algorithm based on element-wise optimization is proposed. Numerical results demonstrate that the FD system with the proposed schemes can achieve a larger gain over the half-duplex system, and the IRS is able to achieve a balance between suppressing SI and providing beamforming gain.

A Laplacian Pyramid Based Generative H&E Stain Augmentation Network

Hematoxylin and Eosin (H&E) staining is a widely used sample preparation procedure for enhancing the saturation of tissue sections and the contrast between nuclei and cytoplasm in histology images for medical diagnostics. However, various factors, such as the differences in the reagents used, result in high variability in the colors of the stains actually recorded. This variability poses a challenge in achieving generalization for machine-learning based computer-aided diagnostic tools. To desensitize the learned models to stain variations, we propose the Generative Stain Augmentation Network (G-SAN) -- a GAN-based framework that augments a collection of cell images with simulated yet realistic stain variations. At its core, G-SAN uses a novel and highly computationally efficient Laplacian Pyramid (LP) based generator architecture, that is capable of disentangling stain from cell morphology. Through the task of patch classification and nucleus segmentation, we show that using G-SAN-augmented training data provides on average 15.7% improvement in F1 score and 7.3% improvement in panoptic quality, respectively. Our code is available at https://github.com/lifangda01/GSAN-Demo.