SearcharxivSearch

arXiv subjects

Mohammad Al-Jarrah

Publications and source records attributed to Mohammad Al-Jarrah.

16 recordsLinked to original sources

Generative models for simulation based filtering: Formulations and Empirical Comparisons

This letter presents a unified formulation and a controlled numerical comparison of generative-model approaches to the nonlinear filtering problem. Under this formulation the analysis step is realized by a transport of the forecast distribution to the posterior, the approaches differing only in how that transport is selected and learned. We derive three new filters, based on stochastic interpolants, their deterministic flow-matching limit, and Schrödinger bridges realized through forward--backward SDEs. We develop a two-stage tuning procedure that separates the training of the generative model from its online refinement. The resulting methods are compared against the optimal transport filter (OTF), the Knothe--Rosenblatt filter (KRF), the sequential importance resampling (SIR) particle filter and the ensemble Kalman filter (EnKF), in terms of accuracy, computational time, and sensitivity to ensemble size and state dimension. The results indicate that every generative filter resolves multimodal posteriors that the EnKF and SIR do not, that no single generative framework dominates, the preferred method being set by the available online budget and ensemble size, and that the filters differ in the regularity of the particle trajectories they produce.

cs.LG

Error Analysis of Triangular Optimal Transport Maps for Filtering

We present a systematic analysis of estimation errors for a class of optimal transport based algorithms for filtering and data assimilation. Along the way, we extend previous error analyses of Brenier maps to the case of conditional Brenier maps that arise in the context of simulation based inference. We then apply these results in a filtering scenario to analyze the optimal transport filtering algorithm of Al-Jarrah et al. (2024, ICML). An extension of that algorithm along with numerical benchmarks on various non-Gaussian and high-dimensional examples are provided to demonstrate its effectiveness and practical potential.

math.ST

A Unified KLD Framework for Duplexity and Deployment Paradigms in Cell-Free mMIMO-ISAC

This paper presents a comparative study of four potential operating configurations for distributed cell-free massive multiple-input multiple-output (CF-mMIMO) ISAC, spanning separated (SE) and shared (SH) access point (AP) deployment with half-duplex (HD) and full-duplex (FD) paradigms. The system comprises distributed APs serving multiple downlink (DL) and uplink (UL) users while simultaneously detecting radar targets. The configurations incorporate realistic impairments at the AP receivers: residual self-interference (SI) from transmit--receive leakage under FD operation, imperfect interference cancellation (IC) of the known radar and DL waveforms due to channel-estimation errors, and environmental clutter. To establish a common analytical scale for communication and sensing, the Kullback--Leibler divergence (KLD) is adopted as a unifying measure that represents both subsystems in comparable quantities, thereby enabling consistent comparison between error-rate and detection metrics. A generalised likelihood ratio test (GLRT) framework is developed, yielding closed-form expressions that link the KLD to the detection probability. Our results confirm the derived KLD-to-symbol error rate (SER) and KLD-to-detection links: with adequate SI suppression and IC quality, FD attains substantial communication gains over HD while preserving strong radar detection, and SH deployment raises both communication and radar performance through its larger effective aperture, though its radar gain then depends on cancellation quality, which SE deployment avoids by isolating the subsystems. These trends persist under imperfect channel state information (CSI) and sensing estimation, and a complexity analysis attributes the SH deployment and FD gains to a higher per-configuration processing cost, yielding deployment guidelines and quantitative design thresholds for next-generation CF-mMIMO ISAC systems.

eess.SP

Conditional Sampling via Wasserstein Autoencoders and Triangular Transport

We present Conditional Wasserstein Autoencoders (CWAEs), a framework for conditional simulation that exploits low-dimensional structure in both the conditioned and the conditioning variables. The key idea is to modify a Wasserstein autoencoder to use a (block-) triangular decoder and impose an appropriate independence assumption on the latent variables. We show that the resulting model gives an autoencoder that can exploit low-dimensional structure while simultaneously the decoder can be used for conditional simulation. We explore various theoretical properties of CWAEs, including their connections to conditional optimal transport (OT) problems. We also present alternative formulations that lead to three architectural variants forming the foundation of our algorithms. We present a series of numerical experiments that demonstrate that our different CWAE variants achieve substantial reductions in approximation error relative to the low-rank ensemble Kalman filter (LREnKF), particularly in problems where the support of the conditional measures is truly low-dimensional.

cs.LG

A Framework for Holistic KLD-based Waveform Design for Multi-User-Multi-Target ISAC Systems

This paper introduces a novel framework aimed at designing integrated waveforms for robust integrated sensing and communication (ISAC) systems. The system model consists of a multiple-input multiple-output (MIMO) base station that simultaneously serves communication user equipments (UEs) and detects multiple targets using a shared-antenna deployment scenario. By leveraging Kullback-Leibler divergence (KLD) to holistically characterise both communication and sensing subsystems, three optimisation problems are formulated: (i) radar waveform KLD maximisation under communication constraints, (ii) communication waveform KLD maximisation subject to radar KLD requirements, and (iii) an integrated waveform KLD-based optimisation for ISAC that jointly balances both subsystems. The first two problems are solved using a projected gradient method with adaptive penalties for the radar waveforms and a gradient-assisted interior point method (IPM) for the communication waveforms. The third, integrated waveform optimisation approach adopts an alternating direction method of multipliers (ADMM) framework to unify radar and communication waveform designs into a single integrated optimisation, thereby synergising sensing and communication objectives and achieving higher overall performance than either radar- or communication-only techniques. Unlike most existing ISAC waveform designs that regard communication signals solely as interference for sensing, the proposed framework utilises the holistic ISAC waveform-that is, the superimposed communication and sensing signals-to boost detection performance in the radar subsystem. Simulation results show significant improvements in both radar detection and communication reliability compared with conventional zero-forcing beamforming, identity-covariance radar baselines, and traditional optimisation approaches,..

eess.SP

Nonlinear Filtering with Brenier Optimal Transport Maps

This paper is concerned with the problem of nonlinear filtering, i.e., computing the conditional distribution of the state of a stochastic dynamical system given a history of noisy partial observations. Conventional sequential importance resampling (SIR) particle filters suffer from fundamental limitations, in scenarios involving degenerate likelihoods or high-dimensional states, due to the weight degeneracy issue. In this paper, we explore an alternative method, which is based on estimating the Brenier optimal transport (OT) map from the current prior distribution of the state to the posterior distribution at the next time step. Unlike SIR particle filters, the OT formulation does not require the analytical form of the likelihood. Moreover, it allows us to harness the approximation power of neural networks to model complex and multi-modal distributions and employ stochastic optimization algorithms to enhance scalability. Extensive numerical experiments are presented that compare the OT method to the SIR particle filter and the ensemble Kalman filter, evaluating the performance in terms of sample efficiency, high-dimensional scalability, and the ability to capture complex and multi-modal distributions.

cs.LG

Fast filtering of non-Gaussian models using Amortized Optimal Transport Maps

In this paper, we present the amortized optimal transport filter (A-OTF) designed to mitigate the computational burden associated with the real-time training of optimal transport filters (OTFs). OTFs can perform accurate non-Gaussian Bayesian updates in the filtering procedure, but they require training at every time step, which makes them expensive. The proposed A-OTF framework exploits the similarity between OTF maps during an initial/offline training stage in order to reduce the cost of inference during online calculations. More precisely, we use clustering algorithms to select relevant subsets of pre-trained maps whose weighted average is used to compute the A-OTF model akin to a mixture of experts. A series of numerical experiments validate that A-OTF achieves substantial computational savings during online inference while preserving the inherent flexibility and accuracy of OTF.

math.OC

RIS-enabled Multi-user M-QAM Uplink NOMA Systems: Design, Analysis, and Optimization

Non-orthogonal multiple access (NOMA) is widely recognized for enhancing the energy and spectral efficiency through effective radio resource sharing. However, uplink NOMA systems face greater challenges than their downlink counterparts, as their bit error rate (BER) performance is hindered by an inherent error floor due to error propagation caused by imperfect successive interference cancellation (SIC). This paper investigates BER performance improvements enabled by reconfigurable intelligent surfaces (RISs) in multi-user uplink NOMA transmission. Specifically, we propose a novel RIS-assisted uplink NOMA design, where the RIS phase shifts are optimized to enhance the received signal amplitudes while mitigating the phase rotations induced by the channel. To achieve this, we first develop an accurate channel model for the effective user channels, which facilitates our BER analysis. We then introduce a channel alignment scheme for a two-user scenario, enabling efficient SIC-based detection and deriving closed-form BER expressions. We further extend the analysis to a generalized setup with an arbitrary number of users and modulation orders for quadrature amplitude modulation signaling. Using the derived BER expressions, we develop an optimized uplink NOMA power allocation (PA) scheme that minimizes the average BER while satisfying the user transmit power constraints. It will be shown that the proposed NOMA detection scheme, in conjunction with the optimized PA strategy, eliminate SIC error floors at the base station. The theoretical BER expressions are validated using simulations, which confirms the effectiveness of the proposed design in eliminating BER floors.

eess.SP

Flow matching for stochastic linear control systems

This paper addresses the problem of steering an initial probability distribution to a target probability distribution through a deterministic or stochastic linear control system. Our proposed approach is inspired by the flow matching methodology, with the difference that we can only affect the flow through the given control channels. The motivation comes from applications such as robotic swarms and stochastic thermodynamics, where agents or particles can only be manipulated through control actions. The feedback control law that achieves the task is characterized as the conditional expectation of the control inputs for the stochastic bridges that respect the given control system dynamics. Explicit forms are derived for special cases, and a numerical procedure is presented to approximate the control law, illustrated with examples.

math.OC

Optimization of Energy-Constrained IRS-NOMA Using a Complex Circle Manifold Approach

This work investigates the performance of intelligent reflective surfaces (IRSs) assisted uplink non-orthogonal multiple access (NOMA) in energy-constrained networks. Specifically, we formulate and solve two optimization problems; the first aims at minimizing the sum of users' transmit power, while the second targets maximizing the system level energy efficiency (EE). The two problems are solved by jointly optimizing the users' transmit powers and the beamforming coefficients at IRS subject to the users' individual uplink rate and transmit power constraints. A novel and low complexity algorithm is developed to optimize the IRS beamforming coefficients by optimizing the objective function over a \textit{complex circle manifold} (CCM). To efficiently optimize the IRS phase shifts over the manifold, the optimization problem is reformulated into a feasibility expansion problem which is reduced to a max-min signal-plus-interference-ratio (SINR). Then, with the aid of a smoothing technique, the exact penalty method is applied to transform the problem from constrained to unconstrained. The proposed solution is compared against three semi-definite programming (SDP)-based benchmarks which are semi-definite relaxation (SDR), SDP-difference of convex (SDP-DC) and sequential rank-one constraint relaxation (SROCR). The results show that the manifold algorithm provides better performance than the SDP-based benchmarks, and at a much lower computational complexity for both the transmit power minimization and EE maximization problems. The results also reveal that IRS-NOMA is only superior to orthogonal multiple access (OMA) when the users' target achievable rate requirements are relatively high.

cs.IT

Generalized BER Performance Analysis for SIC-based Uplink NOMA Systems

Non-orthogonal multiple access (NOMA) is widely recognized for its spectral and energy efficiency, which allows more users to share the network resources more effectively. This paper provides a generalized bit error rate (BER) performance analysis of successive interference cancellation (SIC)-based uplink NOMA systems under Rayleigh fading channels, taking into account error propagation resulting from SIC imperfections. Exact closed-form BER expressions are initially derived for scenarios with 2 and 3 users using quadrature phase shift keying (QPSK) modulation. These expressions are then generalized to encompass any arbitrary rectangular/square M-ary quadrature amplitude modulation (M-QAM) order, number of NOMA users, and number of BS antennas. Additionally, by utilizing the derived closed-form BER expressions, a simple and practically feasible power allocation (PA) technique is devised to minimize the sum bit error rate of the users and optimize the SIC-based NOMA detection at the base-station (BS). The derived closed-form expressions are corroborated through Monte Carlo simulations. It is demonstrated that these expressions can be effective for optimal uplink PA to ensure optimized SIC detection that mitigates error floors. It is also shown that significant performance improvements are achieved regardless of the users' decoding order, making uplink SIC-based NOMA a viable approach.

eess.SP

Data-Driven Approximation of Stationary Nonlinear Filters with Optimal Transport Maps

The nonlinear filtering problem is concerned with finding the conditional probability distribution (posterior) of the state of a stochastic dynamical system, given a history of partial and noisy observations. This paper presents a data-driven nonlinear filtering algorithm for the case when the state and observation processes are stationary. The posterior is approximated as the push-forward of an optimal transport (OT) map from a given distribution, that is easy to sample from, to the posterior conditioned on a truncated observation window. The OT map is obtained as the solution to a stochastic optimization problem that is solved offline using recorded trajectory data from the state and observations. An error analysis of the algorithm is presented under the stationarity and filter stability assumptions, which decomposes the error into two parts related to the truncation window during training and the error due to the optimization procedure. The performance of the proposed method, referred to as optimal transport data-driven filter (OT-DDF), is evaluated for several numerical examples, highlighting its significant computational efficiency during the online stage while maintaining the flexibility and accuracy of OT methods in nonlinear filtering.

math.OC

Novel KLD-based Resource Allocation for Integrated Sensing and Communication

In this paper, we introduce a novel resource allocation approach for integrated sensing-communication (ISAC) using the Kullback-Leibler divergence (KLD) metric. Specifically, we consider a base-station with limited power and antenna resources serving a number of communication users and detecting multiple targets simultaneously. First, we analyze the KLD for two possible antenna deployments, which are the separated and shared deployments, then use the results to optimize the resources of the base-station through minimising the average KLD for the network while satisfying a minimum predefined KLD requirement for each user equipment (UE) and target. To this end, the optimisation is formulated and presented as a mixed integer nonlinear programming (MINLP) problem and then solved using two approaches. In the first approach, we employ a genetic algorithm, which offers remarkable performance but demands substantial computational resources; and in the second approach, we propose a rounding-based interior-point method (RIPM) that provides a more computationally-efficient alternative solution at a negligible performance loss. The results demonstrate that the KLD metric can be an effective means for optimising ISAC networks, and that both optimisation solutions presented offer superior performance compared to uniform power and antenna allocation.

eess.SP

Computational Optimal Transport and Filtering on Riemannian manifolds

In this paper we extend recent developments in computational optimal transport to the setting of Riemannian manifolds. In particular, we show how to learn optimal transport maps from samples that relate probability distributions defined on manifolds. Specializing these maps for sampling conditional probability distributions provides an ensemble approach for solving nonlinear filtering problems defined on such geometries. The proposed computational methodology is illustrated with examples of transport and nonlinear filtering on Lie groups, including the circle $S^1$, the special Euclidean group $SE(2)$, and the special orthogonal group $SO(3)$.

math.OC

Optimal Transport Particle Filters

This paper is concerned with the theoretical and computational development of a new class of nonlinear filtering algorithms called the optimal transport particle filters (OTPF). The algorithm is based on a recently introduced variational formulation of the Bayes' rule, which aims to find the Brenier optimal transport map between the prior and the posterior distributions as the solution to a stochastic optimization problem. On the theoretical side, the existing methods for the error analysis of particle filters and stability results for optimal transport map estimation are combined to obtain uniform error bounds for the filter's performance in terms of the optimization gap in solving the variational problem. The error analysis reveals a bias-variance trade-off that can ultimately be used to understand if/when the curse of dimensionality can be avoided in these filters. On the computational side, the proposed algorithm is evaluated on a nonlinear filtering example in comparison with the ensemble Kalman filter (EnKF) and the sequential importance resampling (SIR) particle filter.

math.OC

Error Rate Analysis of Amplitude-Coherent Detection over Rician Fading Channels with Receiver Diversity

Amplitude-coherent (AC) detection is an efficient detection technique that can simplify the receiver design while providing reliable symbol error rate (SER). Therefore, this work considers AC detector design and SER analysis using M-ary amplitude shift keying (MASK) modulation over Rician fading channels. More specifically, we derive the optimum, near-optimum and a suboptimum AC detectors and compare their SER to the coherent, noncoherent and the heuristic AC detectors. Moreover, the analytical SER of the heuristic detector is derived using two different approaches for single and multiple receiving antennas. One of the derived expressions is expressed in terms of a single integral that can be evaluated numerically, while the second approach gives a closed-form analytical expression for the SER, which is also used to derive a simple formula for the asymptotic SER at high signal-to-noise ratios (SNRs). The obtained analytical and simulation results show that the SER of the AC and coherent MASK detectors are comparable, particularly for high values of the Rician K-factor, and small number of receiving antennas. Moreover, the obtained results show that the SER of the optimal AC detector is equivalent to that of the coherent detector. However, the optimal AC detector complexity is prohibitively high, particularly at high SNRs. In most of the scenarios, the heuristic AC detector significantly outperforms the optimum noncoherent detector, except for the binary ASK case at low SNRs. Moreover, the obtained results show that the heuristic AC detector is immune to phase noise, and thus, it outperforms the coherent detector in scenarios where system is subject to considerable phase noise.

cs.IT