arXiv subjects

Kuranage Roche Rayan Ranasinghe

Publications and source records attributed to Kuranage Roche Rayan Ranasinghe.

At least 19 recordsLinked to original sources

arXiv2026

Integrated Communication and Computing with Index Modulation

We propose an integrated communication and computing (ICC) architecture that repurposes the inactive antennas of a spatial index modulation (IM) transmitter to perform over-the-air computation (AirComp). While IM delivers excellent spectral efficiency by selectively activating a subset of transmit antennas, the unused antennas are conventionally completely deactivated, forgoing spatial degrees of freedom (DoF) that can be exploited without additional bandwidth. By instead transmitting a pre-equalized, low-power computing stream over these idle antennas, the proposed architecture achieves simultaneous data transmission and computation without requiring orthogonal frequency or time resources. Alignment is performed entirely at the transmitters, such that the pre-equalization occurs leveraging local channel state information (CSI), while at the receiver, a vector Gaussian belief propagation (VGaBP) detector recovers the data payload under the discrete IM codebook constraint before the target function is estimated from the residual. Numerical results against exact maximum likelihood (ML) baselines confirm near-optimal detection under the adopted statistical model, and reveal that the number of antennas assigned to data transmission governs a direct trade-off between modulation robustness and AirComp accuracy.

eess.SP↗

arXiv2026

Orbital Detection: On Maximum-Entropy Priors

Soft-input detection over a discrete constellation $\mathcal{M}$ of cardinality $M$ requires computing a posterior whose mean and mode are respectively given by the minimum mean square error (MMSE) and maximum a posteriori (MAP) estimates, both of which incur a computational cost of order $\mathcal{O}(M)$ per symbol. We show that this cost is reduced to $\mathcal{O}(L)$, where $L \le M$ is the number of distinct amplitudes (rings), once the discrete prior is replaced by its maximum-entropy counterpart subject to the same radial marginal. This orbital prior, which is a mixture of uniform circular shells, is obtained by maximizing a mixed discrete-continuous entropy. We prove in this paper that such a distribution is the only distribution on $\mathbb{C}$ that preserves the amplitude statistics of $\mathcal{M}$ exactly while remaining maximally noncommittal in phase. Under the additive white Gaussian noise (AWGN) channel, the orbital prior induces a closed-form posterior that factors into a softmax over the $L$ rings and a von Mises phase distribution whose concentration is supplied entirely by the observation, yielding closed-form orbital MMSE and MAP detectors of the discrete symbol at $\mathcal{O}(L)$ cost. The resulting hierarchical rule selects the ring by posterior mass and the phase by conditional mode. We compare the pairwise ring boundary with that of the joint posterior-density and quantify the leading-order outward shift at high signal-to-noise ratio (SNR). Numerical results using standard constellations confirm that the orbital detectors maintain similar symbol error rate (SER) performance to optimal detectors, at a fraction of the complexity.

cs.IT↗

arXiv2026

Distortion-Aware Integrated Sensing and Communication with Affine Filter Bank Modulation

The stringent energy-efficiency requirements of future Integrated Sensing and Communications (ISAC) systems are fundamentally challenged. Unlike conventional communication systems, ISAC transmitters must radiate significantly higher power to ensure reliable target detection, forcing the High-Power Amplifier (HPA) to operate closer to saturation, where nonlinear distortions become unavoidable. Consequently, the robustness of every candidate ISAC waveform to HPA nonlinearities must be carefully assessed. In this context, this paper investigates the robustness of Affine Filter Bank Modulation (AFBM), a recently proposed waveform that combines the delay-Doppler resilience of affine modulation with reduced Peak-to-Average Power Ratio (PAPR) and improved spectral containment. We develop a statistical characterization of the Ambiguity Function (AF) of the amplified AFBM waveform, deriving approximate expressions for its mean, variance, and Rician-distributed magnitude. Furthermore, a low-complexity Gaussian belief propagation receiver accounting for HPA nonlinearities is proposed for communication detection. Simulation results validate the analytical framework and demonstrate that AFBM preserves favorable sensing characteristics and robust Bit Error Rate (BER) performance even under severe nonlinear amplification.

eess.SP↗

arXiv2026

Orbital Detection

We introduce orbital detection (OD), a framework for designing asymptotically optimal, low-complexity message passing (MP) receivers for digitally modulated multiple-input multiple-output (MIMO) systems, based on relaxing the discrete symbol prior into a mixed discrete-continuous density. The resulting orbital prior factors each symbol's distribution into a discrete radial component, supported on only the $L << M$ amplitude rings of an arbitrary constellation $\mathcal{M}$ of cardinality $M = |\mathcal{M}|$, and a continuous, maximum-entropy phase density on each ring. This compresses the propagated posterior mean and variance losslessly into $3L$ real scalars, and collapses the optimal $\mathcal{O}(M)$-complexity denoiser into a closed-form hierarchy whose per-symbol cost falls to $\mathcal{O}(L)$ and ultimately $\mathcal{O}(1)$: the orbital Bessel denoiser (OBD), its Bessel-free variant the orbital Gaussian denoiser (OGD), and the orbital phase denoiser (OPD), proved irreducible on the ring manifold. A Jacobi-Anger ladder recovers the exact detector with geometrically vanishing error. Five information-theoretic results follow. First, the OBD, OGD, and OPD share an identical leading-order state evolution (SE) fixed point. Second, the sole price is a change in the high-SNR error-decay law, from exponential to linear, which never hardens into an error floor. Third, for any underloaded system the induced rate loss vanishes exponentially in SNR, so every level is asymptotically capacity-achieving in the constellation-constrained sense, attaining $\log_2 M$. Fourth, OD attains a minimum mean square error (MMSE) dimension $d=1/2$, halfway between the $d=0$ Bayes-optimal denoiser (BOD) and the $d=1$ linear receiver. Fifth, a non-asymptotic optimal-transport bound in Wasserstein distance links constellation ring geometry directly to the achievable rate.

cs.IT↗

arXiv2026

Bistatic Integrated Sensing and Communications with Flexible Intelligent Metasurfaces

We propose a novel doubly-dispersive (DD) multiple-input multiple-output (MIMO) channel model incorporating flexible intelligent metasurfaces (FIMs), suitable for integrated sensing and communications (ISAC) in high-mobility scenarios. We show how the proposed FIM-parameterized DD (FPDD) channel model extends to multicarrier waveforms known to perform well in DD environments, namely, orthogonal frequency division multiplexing (OFDM), orthogonal time frequency space (OTFS), and affine frequency division multiplexing (AFDM). Leveraging this model, we formulate an achievable rate maxi-mization problem with a sensing constraint for all waveforms and solve it via gradient ascent with closed-form gradients. Numerical results indicate that FIM technology significantly impacts the achievable rate, with careful parametrization essential for strong ISAC performance across all waveforms.

eess.SP↗

arXiv2026

Characterization of Continuous Electromagnetic Manifolds via Calculus of Variations

We present a novel calculus of variations (CoV)-based framework for the characterizing of, and beamforming over, continuous electromagnetic manifolds of arbitrary multiple-input multiple-output (MIMO) array geometries. Building upon the discrete moment-matrix formulation of the state-of-the-art (SotA), the proposed framework simultaneously overcomes three of its fundamental limitations: (i) the point-source approximation error incurred by the near-field radiation operator; (ii) the confinement of the beamforming space to the N-dimensional subspace dictated by the hardware port count; and (iii) the generalization to arbitrary array geometries. To this end, each mesh element is modeled as a two-dimensional planar patch whose spatially averaged Green's function is evaluated via Gauss-Legendre (GL) quadrature, yielding a strictly more accurate near-field representation at negligible additional cost, while a continuous feeding function w(p) in L^2(S_T), introduced as the infinite-dimensional limit of the N-port network, lifts the optimization onto a hardware-decoupled current subspace of dimension K >> N. As an application example, we employ the proposed CoV-based framework to derive closed-form optimal beamformers for both unconstrained field-strength maximization, and a near-field pattern synthesis under a power density (PD) and region constraints, establishing their exact analogy to the discrete and generalized matched filters. Full-wave MATLAB Antenna Toolbox validation confirms consistent near-field accuracy gains over the SotA baseline for both linear and planar geometries at comparable computational cost.

eess.SP↗

arXiv2026

Mutual Coupling in Continuous Aperture Arrays: Physical Modeling and Beamforming Design

The phenomenon of mutual coupling in continuous aperture arrays (CAPAs) is studied. First, a general physical model for the phenomenon that accounts for both polarization and surface dissipation losses is developed. Then, the unipolarized coupling kernel is characterized, revealing that polarization induces anisotropic coupling and invalidates the conventional half-wavelength spacing rule for coupling elimination. Next, the beamforming design problem for CAPAs with coupling is formulated as a functional optimization problem, leading to the derivation of optimal beamforming structures via the calculus of variations. To address the challenge of inverting the coupling kernel in the optimal structure, two methods are proposed: 1) the kernel approximation method, which yields a closed-form solution via wavenumber-domain transformation and GaussLegendre quadrature, and 2) the conjugate gradient method, which addresses an equivalent quadratic functional optimization problem iteratively. Furthermore, the optimal array gain and beampattern are analyzed at the large-aperture limit. Finally, the proposed continuous mutual coupling model is extended to spatially discrete arrays (SPDAs), and comprehensive numerical results are provided, demonstrating that: 1) coupled SPDA performance correctly converges to the CAPA limit, while uncoupled models are shown to violate physics, 2) polarization results in anisotropic array gain behavior, and 3) the coupled beampattern exhibits higher directivity than the uncoupled beampattern.

cs.IT↗

arXiv2026

Joint Synchronization and Radar Parameter Estimation for OFDM-based DISAC Systems

We propose a novel approach to the synchronization paradigm in distributed ISAC (DISAC) systems in doubly-dispersive (DD) channel environments via a joint synchronization and radar parameter estimation framework. The proposed method exploits the structure of the system model, which can be linearized in order to apply a bivariate Gaussian belief propagation (GaBP) algorithm that jointly estimates the time offset (TO) and carrier frequency offset (CFO) of each base station (BS), as well as the delay and Doppler parameters of the DD channel in conventional orthogonal frequency division multiplexing (OFDM) systems. Simulation results demonstrate the effectiveness of the proposed algorithm, showing that the radar parameter estimates (i.e., range and velocity) and synchronization parameter estimates (i.e., TO and CFO) approach the Cramér Rao lower bound (CRLB) even at moderate-to-high signal-to-noise ratio (SNR) regimes.

eess.SP↗

arXiv2026

Learning to Compute on Dirty Paper

We propose a fully learning-based approach to integrated communication and computing (ICC) that combines dirty paper coding (DPC) with over-the-air computation. Each user employs a neural encoder with sinusoidal activations that learns to pre-cancel its own computing symbol as non-causally known interference, recovering modulo-like periodic structures consistent with lattice-based DPC schemes. A joint neural decoder recovers all users' messages from the received signal, while a separate neural AirComp estimator exploits a multi-slot block structure to estimate a target function of the computing symbols after the encoder-decoder network converges. To our knowledge, this is the first fully learning-based approach to jointly address DPC-based interference pre-cancellation and over-the-air computation in a unified framework.

eess.SP↗

arXiv2026

Manifold Optimization-based Pilot Allocation for Cell-Free Massive MIMO ISAC Systems

We address the challenge of pilot design in cell-free massive multiple input multiple output (CF-mMIMO) integrated sensing and communications (ISAC) systems. We propose a novel pilot allocation framework based on manifold optimization that maximizes the system sum rate by minimizing coherence among pilot sequences, while enforcing unimodularity constraints in the frequency domain to ensure pilots are suitable for both communication and sensing tasks. Simulation results demonstrate that the proposed pilot design achieves communication performance comparable to state-of-the-art (SotA) algorithms, while delivering superior sensing capabilities due to its unimodular structure. These results highlight the potential of manifold-based pilot design for practical CF-mMIMO ISAC deployment.

eess.SP↗

arXiv2026

Fractional Programming and Manifold Optimization for Reciprocal BD-RIS Scattering Matrix Design

We investigate the problem of maximizing the sum-rate performance of a beyond-diagonal reconfigurable intelligent surface (BD-RIS)-aided multi-user (MU)-multiple-input single-output (MISO) system using fractional programming (FP) techniques. More specifically, we leverage the Lagrangian Dual Transform (LDT) and Quadratic Transform (QT) to derive an equivalent objective function which is then solved iteratively via a manifold optimization framework. It is shown that these techniques reduce the complexity of the optimization problem for the scattering matrix solution, while also providing notable performance gains compared to state-of-the-art (SotA) methods under the same system conditions. Simulation results confirm the effectiveness of the proposed method in improving sum-rate performance.

eess.SP↗

arXiv2026

Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective

Emerging wireless systems are evolving toward larger, denser, higher-frequency, and more reconfigurable apertures, which motivates the study of continuous-aperture arrays (CAPAs). Unlike conventional spatially discrete arrays (SPDAs), CAPAs are more naturally modeled as spatially continuous electromagnetic apertures and therefore call for a fundamental shift in both signal processing and information-theoretic analysis. In particular, the underlying channels, signals, and beamformers are no longer finite-dimensional vectors and matrices, but continuous fields and operators governed by Maxwell's equations. This paper provides a tutorial overview of CAPA systems from the perspective of electromagnetic signal and information theory (ESIT), with an emphasis on the transition from discrete array models to physics-consistent continuous-aperture formulations. We review the electromagnetic foundations of CAPAs, practical hardware implementations, line-of-sight and multipath channel modeling, continuous-space beamforming and channel estimation, and the fundamental degrees of freedom and capacity limits of CAPA systems. We also highlight how tools such as wavenumber-domain methods, functional analysis, and compressive sensing can transform challenging infinite-dimensional problems into tractable finite-dimensional ones while preserving the essential physical structure of the channel. Overall, this tutorial aims to clarify the key principles, analytical tools, and open challenges that shape CAPA-enabled wireless communications.

cs.IT↗

arXiv2026

A Novel Framework for the Characterization of Continuous Electromagnetic Manifolds

A unified framework for the characterization of continuous electromagnetic (EM) manifolds for arbitrary multipleinput multiple-output (MIMO) system geometries is presented. The EM manifold refers to the set of all physically realizable radiated field vectors, parameterized by the array excitation, that encodes the full spatial structure of the antenna system including near-field phase variations, polarization, and mutual coupling. Building upon the discrete moment-matrix formulation, the proposed framework addresses three fundamental limitations simultaneously: (i) point-source near-field modeling errors in the radiation operator; (ii) confinement of the beamforming space to the $N$-dimensional subspace dictated by hardware port count; and (iii) restriction to linear (1D) array geometries. Each mesh element is modeled as a two-dimensional (2D) planar patch, whose spatially averaged Green's function is evaluated via Gauss-Legendre (GL) quadrature, yielding superior nearfield accuracy at negligible additional cost. A continuous feeding function $w(\mathbf{p})\in L^2(\mathcal{S}_\mathrm{T})$ is introduced as the infinite-dimensional limit of the $N$-port network, enabling optimization over a higher dimensional current subspace, decoupled from hardware constraints. Full-wave MATLAB Antenna Toolbox validation confirms near-field accuracy improvements over the state-of-the-art (SotA) baseline for both linear and planar array geometries, while maintaining reasonable computational complexity.

eess.SP↗

arXiv2026

Regularized Approximate Message Passing for Overloaded Discrete Linear Inversion

We propose regularized approximate message passing (RAMP), a low-complexity algorithm for discrete signal detection in overloaded multiple-input multiple-output (MIMO) systems where the number of transmit antennas exceeds the number of receive antennas. While the state-of-the-art (SotA) iterative discrete least squares (IDLS) framework achieves near-optimal discrete-aware performance, its iterative matrix inversions impose a prohibitive $\mathcal{O}(M^3)$ complexity. RAMP resolves this by deriving an adaptive, state-dependent scalar denoiser that enforces arbitrary discrete constellation constraints within the approximate message passing (AMP) framework, reducing per-iteration complexity to $\mathcal{O}(NM)$. A robust variant is further proposed by incorporating an $\ell_2$-norm penalty, analogous to a linear minimum mean squared error (LMMSE) estimator, to enhance noise resilience. Simulation results under uncorrelated Rayleigh fading demonstrate that both proposed algorithms closely track their exact IDLS counterparts while avoiding the catastrophic failure of standard AMP in the overloaded regime, achieving steep bit error rate (BER) waterfall curves at a fraction of the computational cost.

eess.SP↗

arXiv2026

1-bit Quantized Continuous Aperture Arrays

Continuous aperture arrays (CAPAs) have emerged as a promising physical-layer paradigm for sixth generation (6G) systems, offering spatial degrees of freedom beyond those of conventional discrete antenna arrays. This paper investigates the interaction between the CAPA receive architecture and low-cost 1-bit analog-to-digital converters (ADCs), which impose a severe nonlinear distortion penalty in conventional discrete systems. For Rayleigh fading, we derive a moment matching approximation (MMA)-based closed-form symbol error probability (SEP) approximation based on Gamma moment-matching of the spatial eigenvalue distribution, and show that CAPAs incur a diversity-order penalty governed by Jensen's inequality on the mode eigenvalues. For line-of-sight (LoS) propagation, we prove that CAPA achieves exactly the unquantized additive white Gaussian noise (AWGN) performance bound under perfect spatial and phase alignment, completely eliminating the 1-bit penalty that forces discrete systems to double their antenna count. Monte Carlo simulations under Rayleigh, Rician, and LoS conditions validate all analytical results.

eess.SP↗

arXiv2026

Affine Frequency Division Multiplexing (AFDM) for 6G: Properties, Features, and Challenges

Affine frequency division multiplexing (AFDM) is an emerging waveform candidate for future sixth generation (6G) systems offering a range of promising features, such as enhanced robustness in heterogeneous and high-mobility environments, as well as inherent suitability for integrated sensing and communications (ISAC) applications. In addition, unlike other candidates such as orthogonal time-frequency space (OTFS) modulation, AFDM provides several unique advantages that strengthen its relevance to practical deployment and standardization in 6G. Notably, as a natural generalization of orthogonal frequency division multiplexing (OFDM), strong backward compatibility with existing conventional systems is guaranteed, while also offering novel possibilities in waveform design, for example to enable physical-layer security through its inherent chirp parametrization. In all, this article provides an overview of AFDM, emphasizing its suitability as a candidate waveform for 6G standardization. First, we provide a concise introduction to the fundamental properties and unique characteristics of AFDM, followed by highlights of its advantageous features, and finally a discussion of its potential and challenges in 6G standardization efforts and representative requirements.

eess.SP↗

arXiv2025

SIR Analysis for Affine Filter Bank Modulation

The signal-to-interference ratio (SIR) of the Affine Filter Bank Modulation (AFBM) waveform is analyzed under minimum mean square error (MMSE) equalization in two domains; namely, the affine domain and the filtered time-domain (TD). Due to the incorporation of the discrete affine Fourier transform (DAFT) and despreading/mapping, an interesting and counter-intuitive cancellation of the unwanted combination of the channel induced interference with the orthogonality approximation error is seen in the filtered TD, a process which does not occur in the affine domain. The direct impact on bit error rate (BER) provides a thorough validation of the proposed analysis and explains the substantial gains in performance of the filtered TD detection scheme as opposed to its affine domain equivalent

eess.SP↗

arXiv2025

6D Rigid Body Localization and Velocity Estimation via Gaussian Belief Propagation

We propose a novel message-passing solution to the sixth-dimensional (6D) moving rigid body localization (RBL) problem, in which the three-dimensional (3D) translation vector and rotation angles, as well as their corresponding translational and angular velocities, are all estimated by only utilizing the relative range and Doppler measurements between the "anchor" sensors located at an 3D (rigid body) observer and the "target" sensors of another rigid body. The proposed method is based on a bilinear Gaussian belief propagation (GaBP) framework, employed to estimate the absolute sensor positions and velocities using a range- and Doppler-based received signal model, which is then utilized in the reconstruction of the RBL transformation model, linearized under a small-angle approximation. The method further incorporates a second bivariate GaBP designed to directly estimate the 3D rotation angles and translation vectors, including an interference cancellation (IC) refinement stage to improve the angle estimation performance, followed by the estimation of the angular and the translational velocities. The effectiveness of the proposed method is verified via simulations, which confirms its improved performance compared to equivalent state-of-the-art (SotA) techniques.

eess.SP↗