arXiv subjects

David J. Love

Publications and source records attributed to David J. Love.

At least 19 recordsLinked to original sources

arXiv2026

Optimal Multi-RIS Placement: Coverage-Guaranteed Sum Rate Maximization Under Inhomogeneous User Distributions

Reconfigurable Intelligent Surface (RIS) has emerged as a promising next-generation technology that improves the throughput and coverage of a wireless system. The realization of the full potential of RISs in a wireless system is tied to their strategic spatial deployment. While existing literature on RIS placement primarily focuses on maximizing coverage, when multiple RIS placements guarantee the required coverage (happens quite often), these approaches fail to exploit prior user trends to choose the one that is most probable to maximize throughput. Thus, to enable throughput maximization while guaranteeing fairness, we formulate a novel hierarchical problem that maximizes the expected sum rate of the system while guaranteeing a certain probabilistic coverage, with the requisite minimum number of RISs deployed. To solve this multi-layered non-convex problem, firstly, we obtain a set of optimal points where we can deploy RISs to provide the coverage guarantee. Then, the least number of RISs that can guarantee the required coverage is obtained by a greedy minimum partitioning. Finally, a Bayesian optimization based approach is used to compute the optimal RIS placement. Numerical results are provided to show that the proposed framework consistently identifies placements that jointly achieve good coverage and throughput, without impractical assumptions.

eess.SP↗

arXiv2026

MaskCode: Mask Transformer for Feedback-Assisted Coding With Linear Block Codes

Feedback-based coding schemes have demonstrated substantial performance gains over today's open-loop coding schemes. Unfortunately, these gains are usually achieved in idealized settings with perfect feedback. Over the last few years, machine learning-based schemes have been shown to be promising solutions for implementing feedback-based codes, particularly when combined with short-block-length open-loop error correcting codes (ECCs) in a concatenated coding structure. However, existing ML-based feedback schemes remain agnostic to the outer code's structure, potentially misallocating feedback resources on error patterns already correctable by the outer ECC. To address this, we propose MaskCode, a Transformer-based inner feedback code for concatenated coding systems, which explicitly incorporates structural knowledge of the outer linear block code into the inner feedback encoder design via two synergistic mechanisms: 1) a soft syndrome-based input that informs the encoder about potential parity constraint violations, and 2) a code-aware attention mask derived from the Tanner graph. We further show that end-to-end training with a differentiable belief propagation (BP) decoder offers no additional gain, as MaskCode's structure-aware design already internalizes the structural knowledge of the outer code; in fact, backpropagation through the iterative BP decoder introduces gradient explosion, which degrades rather than improves performance. Extensive evaluations on BCH and LDPC outer codes demonstrate that MaskCode consistently outperforms all baselines, achieving up to 1.5 dB SNR gain.

cs.IT↗

arXiv2026

Distributed Edge Learning under Imperfect Data Sensing

Distributed learning systems typically assume that local data is already available at clients with fixed quality, while in practice, data is sensed through imperfect physical processes whose quality depends on modality, resolution, sensing power, and sample size. We model sensing noise as a structured, modality-dependent covariance and derive a non-convex learning convergence bound whose irreducible sensing floor is governed by the alignment between the modality noise covariance and the loss-sensitivity geometry. Thus, the optimal modality minimizes this noise-gradient alignment rather than total noise power alone. The analysis further yields a sensor-hardware achievability bound for epsilon-stationarity and a hardware-saturation threshold on the accumulated dataset size. We jointly optimize modality, resolution, power, and sample count and demonstrate the performance gain through simulations.

cs.IT↗

arXiv2026

AISAC: Closing the Loop Between AI and Integrated Sensing and Communication for 6G

Integrated sensing and communication (ISAC) and AI-and-communication (AIAC) are identified as separate usage scenarios in the ITU IMT-2030 vision for sixth-generation (6G) networks. In practice, however, these two directions are already beginning to merge. ISAC gives the network a way to observe the physical world, while AI gives the network a way to learn from those observations and act on them. This article introduces AI-integrated sensing and communication (AISAC) as a closed-loop framework for this merger. In AISAC, AI is not only a tool used to optimize an ISAC system. ISAC is also the physical substrate through which AI receives data, context, and connectivity. The key technical message is that AISAC requires a new physical-layer design principle, in which the ISAC waveform, beam, power, bandwidth, and sensing mode should be configured for learning alignment, not for sensing distortion or communication rate alone. In particular, the sensing configuration that is most accurate from a classical estimation viewpoint need not be the one that is most useful for training or inference. We present the AISAC landscape, explain why imperfect sensing changes the learning problem, develop the closed-loop architecture and its three-way sensing-communication-learning tension, and outline a vehicular edge-intelligence use case together with open problems for theory, implementation, and standardization.

cs.IT↗

arXiv2026

Parasitic MIMO Beamforming for Multi-Active Multi-Parasitic Antenna Arrays with Binary Control

In 6G, MIMO dimensions continue to scale, yet the increased cost, power consumption, and hardware complexity associated with growing RF chains limit practical deployment. Parasitic antennas offer a promising alternative that can add spatial degrees of freedom and array gain without a proportional increase in RF chains. From a communication perspective, prior work on parasitic antennas has primarily focused on adjusting continuous reactance values using varactors, but such varactor-based tuning has increased cost and complexity in the analog control and practical RF circuit design. This paper proposes a multi-active multi-parasitic antenna (MAMP) architecture with binary controllers, where each parasitic element operates in one of two discrete reactance states. To validate the practicality of the system, we experimentally identify array geometries that best match the actual radiation patterns with those of the mathematical model through HFSS simulations. We express the induced current vector as a quadratic function of the binary state vector, and propose a pair of discrete reactance values that minimize the relative error of the proposed model while being implementable with off-the-shelf RF components. With these results, we develop two transmit beamforming codebook designs based on the generalized Lloyd algorithm. The first design exhaustively searches for all possible binary combinations to find the optimal solution, representing the theoretical upper limits of our framework. The second design leverages eigenvalue perturbation to significantly reduce computational complexity, making it suitable for online adaptation. Extensive simulations under various channel scenarios demonstrate that the proposed codebook designs enable MAMP with only few active antennas to achieve beamforming performance comparable to fully active antenna arrays with significantly more active antennas.

eess.SP↗

arXiv2026

Channel Estimation via Successive Denoising in MIMO OFDM Systems: A Reinforcement Learning Approach

In general, reliable communication via multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) requires accurate channel estimation at the receiver. The existing literature largely focuses on denoising methods for channel estimation that depend on either (i) channel analysis in the time-domain with prior channel knowledge or (ii) supervised learning techniques which require large pre-labeled datasets for training. To address these limitations, we present a frequency-domain denoising method based on a reinforcement learning framework that does not need a priori channel knowledge and pre-labeled data. Our methodology includes a new successive channel denoising process based on channel curvature computation, for which we obtain a channel curvature magnitude threshold to identify unreliable channel estimates. Based on this process, we formulate the denoising mechanism as a Markov decision process, where we define the actions through a geometry-based channel estimation update, and the reward function based on a policy that reduces mean squared error (MSE). We then resort to Q-learning to update the channel estimates. Numerical results verify that our denoising algorithm can successfully mitigate noise in channel estimates. In particular, our algorithm provides a significant improvement over the practical least squares (LS) estimation method and provides performance that approaches that of the ideal linear minimum mean square error (LMMSE) estimation with perfect knowledge of channel statistics.

eess.SP↗

arXiv2026

Dynamic and Robust Sensor Selection Strategies for Wireless Positioning with TOA/RSS Measurement

Emerging wireless applications are requiring ever more accurate location-positioning from sensor measurements. In this paper, we develop sensor selection strategies for 3D wireless positioning based on time of arrival (TOA) and received signal strength (RSS) measurements to handle two distinct scenarios: (i) known approximated target location, for which we conduct dynamic sensor selection to minimize the positioning error; and (ii) unknown approximated target location, in which the worst-case positioning error is minimized via robust sensor selection. We derive expressions for the Cramér-Rao lower bound (CRLB) as a performance metric to quantify the positioning accuracy resulted from selected sensors. For dynamic sensor selection, two greedy selection strategies are proposed, each of which exploits properties revealed in the derived CRLB expressions. These selection strategies are shown to strike an efficient balance between computational complexity and performance suboptimality. For robust sensor selection, we show that the conventional convex relaxation approach leads to instability, and then develop three algorithms based on (i) iterative convex optimization (ICO), (ii) difference of convex functions programming (DCP), and (iii) discrete monotonic optimization (DMO). Each of these strategies exhibits a different tradeoff between computational complexity and optimality guarantee. Simulation results show that the proposed sensor selection strategies provide significant improvements in terms of accuracy and/or complexity compared to existing sensor selection methods.

eess.SP↗

arXiv2026

Unlocking Realism and Interpretability in Wireless Channel Synthesis: A Physics-Guided Generative Approach

In recent years, machine learning (ML) methods have become increasingly popular for wireless communication systems. These require large amounts of data reflecting the behavior of realistic channels with high fidelity. However, sampling over-the-air (OTA) channel data is an extremely resource-intensive process which cannot accurately represent the variety of real world channels. This results in the need for realistic training data for ML systems. To this end, generative models have been proposed to synthesize channel data. However,(i) the outputs produced by such methods may not correspond to physically viable channels, (ii) the outputs may not provide insights into the associated environment, and (iii) training the generative model may need labeled data, requiring resource intensive data annotation. Through this work, we address these issues by integrating a parametric, physics-based geometric channel (PPGC) modeling framework derived from planar wave propagation equations, with generative methods to produce realistic channel matrices with interpretable representations in the parameter domain. To overcome the limitations of the resulting non-convex optimization landscape, we propose a linearized reformulation of the PPGC model to ensure smooth gradient flow during training, while also providing insights into the underlying physical environment. We incorporate a tensor decomposition framework into the linearized reformulation to allow for flexibility in the number of wireless channel parameters. We also show the compatibility of this reformulation with parameter extraction tasks. We evaluate our model against prior baselines by comparing generated, scenario-specific samples to true channels in terms of their similarity and through their utility in downstream compression tasks.

eess.SP↗

arXiv2026

Simulation-Driven Ensemble Machine Learning for Robust and Generalizable Path Loss Prediction

Machine learning has emerged as a promising approach to path loss prediction, yet its effectiveness often degrades when measurement data are scarce. To address this limitation, we propose an ensemble-based machine learning framework that integrates real measurements with synthetic data generated using a lidar-based simulator. The simulator provides broad spatial coverage through static path loss values that capture terrain variations and physical obstacles in the propagation environment. A dynamically weighted ensemble then combines simulation results with measured data, balancing the contribution of both data sources and improving generalization across diverse environments. To further mitigate the effects of limited measurements, we incorporate the Synthetic Minority Over-sampling Technique (SMOTE), a data augmentation technique that synthesizes additional samples through interpolation between measurements while preserving their statistical properties. By leveraging simulation data, SMOTE, and engineered propagation features, the proposed framework captures geographical and physical variability, enabling adaptability across urban, suburban, residential, industrial, and rural environments. Experimental results demonstrate that the proposed method achieves up to a 50% reduction in mean absolute error (MAE), compared with models trained solely on real data, and up to a 25% improvement relative to models trained exclusively on synthetic data, particularly for cross-environment generalization. These findings highlight the effectiveness of combining simulation-based synthetic data with SMOTE to overcome data scarcity and enhance the model's generalization ability. Overall, the proposed framework provides a robust and practical solution for path loss prediction across diverse environments with limited measurement data, supporting cost-effective planning and optimization of wireless networks.

eess.SP↗

arXiv2026

CITYMPC: A Large-Scale Physics-Informed Benchmark and Tool for Generative Complete Multipath Wireless Channel Modeling

Multipath wireless channels are fully characterized by multipath components (MPCs), including complex channel gain, propagation delay, angle of departure (AoD) and angle of arrival (AoA) in azimuth and elevation. Generating these parameters with the fidelity of ray tracing (RT) remains an open problem. Existing methods either incur the computational cost of RT or require explicit 3D scene geometry at inference. We present CITYMPC, a conditional variational autoencoder (cVAE) that predicts the complete per-path MPC parameter set from point-of-view imagery and terrain height maps alone, achieving environment-aware channel generation without access to any three-dimensional scene geometry at inference. Trained and evaluated across five urban environments spanning 427,397 links, CITYMPC matches RT ground truth to within 1.29 dB received power mean absolute error (MAE) and 7.25 ns $τ_0$ MAE. CITYMPC is a generative channel modeling framework and reproducible benchmark, released together with a large-scale multi-city ray-traced dataset to accelerate future scene-conditioned channel modeling research. We further analyze cross-city distribution shift to characterize the per-city diversity of the benchmark.

eess.SP↗

arXiv2026

Coherence-Aware Over-the-Air Distributed Learning under Heterogeneous Link Impairments

Distributed machine learning (ML) over wireless networks hinges on accurate channel state information (CSI) and efficient exchange of high-dimensional model updates. These demands are governed by channel coherence time and bandwidth, which vary across devices (links) due to heterogeneous mobility and scattering, causing degraded downlink delivery and distorted uplink over-the-air (OTA) aggregation. We propose a coherence-aware federated learning (FL) framework that jointly addresses impairments on downlink and uplink with communication-efficient strategies. In the downlink, we employ product superposition to multiplex global model symbols for long-coherence (static) devices onto the pilot tones required by short-coherence (dynamic) devices for channel estimation, turning pilot overhead into payload while preserving estimation fidelity. In the proposed scheme, an orthogonal frequency-division multiplexing (OFDM) super-block is partitioned into sub-blocks aligned with the smallest coherence time and bandwidth, enabling consistent channel estimation and stabilizing OTA aggregation across heterogeneous devices. Partial model reception at dynamic devices is mitigated via previous local model filling (PLMF), which reuses prior updates. We establish convergence guarantees under heterogeneous link impairments, imperfect CSI, and aggregation noise. The proposed framework enables efficient scheduling under coherence heterogeneity; analysis and experiments demonstrate notable gains in communication efficiency, latency, and learning accuracy over conventional FL baselines.

cs.IT↗

arXiv2026

Optimal RIS Placement in Multi-User MISO Systems with User Randomness

It is well established that the performance of reconfigurable intelligent surface (RIS)-assisted systems critically depends on the optimal placement of the RIS. Previous works consider either simple coverage maximization or simultaneous optimization of the placement of the RIS along with the beamforming and reflection coefficients, most of which assume that the location of the RIS, base station (BS), and users are known. However, in practice, only the spatial variation of user density and obstacle configuration are likely to be known prior to deployment of the system. Thus, we formulate a non-convex problem that optimizes the position of the RIS over the expected minimum signal-to-interference-plus-noise ratio (SINR) of the system with user randomness, assuming that the system employs joint beamforming after deployment. To solve this problem, we propose a recursive coarse-to-fine methodology that constructs a set of candidate locations for RIS placement based on the obstacle configuration and evaluates them over multiple instantiations from the user distribution. The search is recursively refined within the optimal region identified in each stage to determine the final optimal region for RIS deployment. Detailed numerical results are presented to corroborate our findings.

eess.SP↗

arXiv2026

Integrated Polarimetric Sensing and Communication with Polarization-Reconfigurable Arrays

Polarization diversity offers a cost- and space-efficient solution to enhance the performance of integrated sensing and communication systems. Polarimetric sensing exploits the signal's polarity to extract details about the target such as shape, pose, and material composition. From a communication perspective, polarization diversity can enhance the reliability and throughput of communication channels. This paper proposes an integrated polarimetric sensing and communication (IPSAC) system that jointly conducts polarimetric sensing and communications. We study the use of single-port polarization-reconfigurable antennas to adapt to channel depolarization effects, without the need for separate RF chains for each polarization. We address two core sensing tasks in IPSAC systems, target parameter estimation and target detection. For parameter estimation, we consider the problem of minimizing the mean-squared error (MSE) of the target depolarization parameter estimate, which is a critical task for various polarimetric radar applications such as rainfall forecasting, vegetation identification, and target classification. To address this nonconvex problem, we apply semi-definite relaxation (SDR) and majorization-minimization (MM) optimization techniques. Next, we consider a design that maximizes the target SINR leveraging prior knowledge of the target and clutter depolarization statistics to enhance the target detection performance. To tackle this problem, we modify the solution developed for MSE minimization subject to the same quality-of-service (QoS) constraints. Extensive simulations show that the proposed polarization reconfiguration method substantially improves the depolarization parameter MSE. Furthermore, the proposed method considerably boosts the target SINR due to polarization diversity, particularly in cluttered environments.

eess.SP↗

arXiv2025

Deep Broadcast Feedback Codes

Recent advances in deep learning for wireless communications have renewed interest in channel output feedback codes. In the additive white Gaussian broadcast channel with feedback (AWGN-BC-F), feedback can expand the channel capacity region beyond that of the no-feedback case, but linear analytical codes perform poorly with even small amounts of feedback noise. Deep learning enables the design of nonlinear feedback codes that are more resilient to feedback noise. We extend single-user learned feedback codes for the AWGN channel to the broadcast setting, and compare their performance with existing analytical codes, as well as a newly proposed analytical scheme inspired by the learned schemes. Our results show that, for a fixed code rate, learned codes outperform analytical codes at the same blocklength by using power-efficient nonlinear structures and are more robust to feedback noise. Analytical codes scale more easily to larger blocklengths with perfect feedback and surpass learned codes at higher SNRs.

eess.SP↗

arXiv2025

Pilot Contamination-Aware Graph Attention Network for Power Control in CFmMIMO

Optimization-based power control algorithms are predominantly iterative with high computational complexity, making them impractical for real-time applications in cell-free massive multiple-input multiple-output (CFmMIMO) systems. Learning-based methods have emerged as a promising alternative, and among them, graph neural networks (GNNs) have demonstrated their excellent performance in solving power control problems. However, all existing GNN-based approaches assume ideal orthogonality among pilot sequences for user equipments (UEs), which is unrealistic given that the number of UEs exceeds the available orthogonal pilot sequences in CFmMIMO schemes. Moreover, most learning-based methods assume a fixed number of UEs, whereas the number of active UEs varies over time in practice. Additionally, supervised training necessitates costly computational resources for computing the target power control solutions for a large volume of training samples. To address these issues, we propose a graph attention network for downlink power control in CFmMIMO systems that operates in a self-supervised manner while effectively handling pilot contamination and adapting to a dynamic number of UEs. Experimental results show its effectiveness, even in comparison to the optimal accelerated projected gradient method as a baseline.

cs.LG↗

arXiv2025

Coherence-Aware Distributed Learning under Heterogeneous Downlink Impairments

The performance of federated learning (FL) over wireless networks critically depends on accurate and timely channel state information (CSI) across distributed devices. This requirement is tightly linked to how rapidly the channel gains vary, i.e., the coherence intervals. In practice, edge devices often exhibit unequal coherence times due to differences in mobility and scattering environments, leading to unequal demands for pilot signaling and channel estimation resources. Conventional FL schemes that overlook this coherence disparity can suffer from severe communication inefficiencies and training overhead. This paper proposes a coherence-aware, communication-efficient framework for joint channel training and model updating in practical wireless FL systems operating under heterogeneous fading dynamics. Focusing on downlink impairments, we introduce a resource-reuse strategy based on product superposition, enabling the parameter server to efficiently schedule both static and dynamic devices by embedding global model updates for static devices within pilot transmissions intended for mobile devices. We theoretically analyze the convergence behavior of the proposed scheme and quantify its gains in expected communication efficiency and training accuracy. Experiments demonstrate the effectiveness of the proposed framework under mobility-induced dynamics and offer useful insights for the practical deployment of FL over wireless channels.

cs.IT↗

arXiv2025

Cooperative Decentralized Backdoor Attacks on Vertical Federated Learning

Federated learning (FL) is vulnerable to backdoor attacks, where adversaries alter model behavior on target classification labels by embedding triggers into data samples. While these attacks have received considerable attention in horizontal FL, they are less understood for vertical FL (VFL), where devices hold different features of the samples, and only the server holds the labels. In this work, we propose a novel backdoor attack on VFL which (i) does not rely on gradient information from the server and (ii) considers potential collusion among multiple adversaries for sample selection and trigger embedding. Our label inference model augments variational autoencoders with metric learning, which adversaries can train locally. A consensus process over the adversary graph topology determines which datapoints to poison. We further propose methods for trigger splitting across the adversaries, with an intensity-based implantation scheme skewing the server towards the trigger. Our convergence analysis reveals the impact of backdoor perturbations on VFL indicated by a stationarity gap for the trained model, which we verify empirically as well. We conduct experiments comparing our attack with recent backdoor VFL approaches, finding that ours obtains significantly higher success rates for the same main task performance despite not using server information. Additionally, our results verify the impact of collusion on attack performance.

cs.LG↗

arXiv2025

Complexity Reduction in Machine Learning-Based Wireless Positioning: Minimum Description Features

A recent line of research has been investigating deep learning approaches to wireless positioning (WP). Although these WP algorithms have demonstrated high accuracy and robust performance against diverse channel conditions, they also have a major drawback: they require processing high-dimensional features, which can be prohibitive for mobile applications. In this work, we design a positioning neural network (P-NN) that substantially reduces the complexity of deep learning-based WP through carefully crafted minimum description features. Our feature selection is based on maximum power measurements and their temporal locations to convey information needed to conduct WP. We also develop a novel methodology for adaptively selecting the size of feature space, which optimizes over balancing the expected amount of useful information and classification capability, quantified using information-theoretic measures on the signal bin selection. Numerical results show that P-NN achieves a significant advantage in performance-complexity tradeoff over deep learning baselines that leverage the full power delay profile (PDP).

cs.LG↗