SearcharxivSearch

arXiv subjects

Sundeep Rangan

Publications and source records attributed to Sundeep Rangan.

At least 19 recordsLinked to original sources

LOCUS-DT: Localization via Observation-Conditioned Uncertainty Scoring with Digital Twins

Accurate indoor localization is essential for emerging applications in robotic navigation and search and rescue. While classical methods typically focus on single-point estimates, complex indoor environments with heavy blockage and multipath propagation often lead to multimodal likelihood surfaces where a single estimate is insufficient. This paper proposes LOCUS-DT (Localization via Observation-Conditioned Uncertainty Scoring with Digital Twins), a framework that treats snapshot localization as posterior inference over the transmitter location. By leveraging a ray-tracing-based digital twin (DT) of the known environment, LOCUS-DT generates synthetic multipath profiles for candidate locations and compares them against the measured channel profile. Central to our approach is a novel learned scoring function designed to compare a fixed number of dominant specular paths, providing robustness against errors in both the DT environment model and the physical channel estimation. Importantly, LOCUS-DT is trained over an ensemble of environments to ensure generalization to unseen layouts. We evaluate the system using a Sionna-based ray-tracing backend, demonstrating that LOCUS-DT captures the sharp, multimodal posterior structures inherent in indoor settings more accurately than standard Gaussian or Gaussian-mixture benchmarks.

eess.SP

Noncoherent Detection and Interference Nulling for Terrestrial-Satellite Downlink Coexistence in the Upper Mid-Band

Terrestrial--satellite coexistence in the upper mid-band is challenging when a terrestrial base station has limited prior information about non-terrestrial receivers and their uplink transmissions. This paper studies noncoherent victim sensing and interference nulling, where uplink sensing snapshots are observed while the transmitted waveform is treated as unknown. For a single victim, we show that the generalized likelihood-ratio test reduces to a principal-eigenvector estimator of the sample covariance. For multiple victims, we combine MDL-based model-order selection with MUSIC to recover anonymous direction and power information that is sufficient for beam design without pilot knowledge or user identities. These estimates are then used in a nulling beamformer that preserves the intended terrestrial link while reducing leakage toward detected victims. We further analyze the single-victim estimator in the large-matrix regime and show that estimation accuracy improves with sensing SNR, which reveals the observed interplay between path loss and estimation quality. Site-specific ray-tracing results show significant reduction of NTN INR with only modest degradation of TN SINR.

eess.SP

Efficient Upper Mid-Band Spectrum Sensing with Multiple Signals

Spectrum sensing is a fundamental problem in the upper mid-band, where spectrum resources are shared with incumbent systems. This paper considers frequency-domain occupancy estimation when the number of primary user signals, their bandwidths, and their signal-to-noise ratios are all unknown. We develop a generalized likelihood ratio test and a computationally efficient search procedure that combines binary search with dynamic programming to select the set of intervals maximizing the sum of log-likelihoods. The proposed method is validated through both simulation data and over-the-air experimental data using an upper mid-band software-defined radio (SDR), demonstrating its practical applicability.

eess.SP

Near Field Multi-Band Localization: CRB, Efficient Estimator, and Threshold SNR

This paper presents a theoretical framework for multi-band localization for a single-path single-input multiple-output (SIMO) system. We derive closed-form Cramer-Rao bounds (CRBs) for angle-of-arrival (AoA) and distance for uniform linear arrays (ULAs), and an intermediate matrix-form formulation for arbitrary array shapes. We also develop benchmark single- and multi-band maximum-likelihood (ML) estimators for AoA-Distance, leveraging a structured Levenberg-Marquardt (LM) refinement procedure. A key contribution is an analytical characterization of the threshold SNR (TSNR) for the proposed estimators. This is the SNR threshold at which the estimator transitions from "off the chart" to CRB-approaching performance, for both TDoA and distance estimation. Numerical simulations confirm that the proposed single- and multi-band estimators achieve the CRB at SNRs above the predicted TSNR, and that multi-band processing simultaneously improves estimation accuracy and reduces SNR requirements. The resulting framework provides a rigorous foundation for next-generation multi-band localization and can be readily extended to elevation estimation, distributed arrays, and multi-path environments.

eess.SP

A Preliminary Assessment of Midhaul Links at 140 GHz using Ray-Tracing

The ever-growing demand for mobile data necessitates a transport network architecture that can withstand the 5G-and-beyond multi-Gbps traffic requirements. To cater for such unprecedented demand, studies are being conducted to incorporate TeraHertz (THz) communications in future mobile networks. In this paper, we consider an urban environment and evaluate the feasibility of THz wireless midhaul links for the transport networks between the Central Units (CU) and Distributed Units (DU) in a disaggregated 5G network architecture with functional splits. Our goal is to study the feasibility of midhaul links at 140 GHz by minimizing the number of required CUs to serve all the DUs. To this end, we define several policies for selecting CU and DU nodes in order to determine the peak data rate that can be supported over each link between a CU and DU. Our numerical results based on ray-tracing suggest that wireless links at 140 GHz with 3GPP option 2 as High Layer Split (HLS) represents a promising technology for midhaul transport networks.

cs.NI

Low-rank Preconditioning in Beamspace Domain For Massive MU-MIMO Long-Term Beamforming

Long-term beamforming substantially reduces the channel estimation and inversion overhead of conventional massive MU-MIMO receivers; yet, its construction still hinges on the inversion of a large Hermitian matrix, whose condition number deteriorates with the per-user SNR dynamic range. When this inversion is approximated in hardware via the conjugate gradient (CG) algorithm, the deterioration directly inflates the iteration count and, consequently, the energy and latency budget. We propose a hardware-friendly low-rank preconditioning framework that targets exactly this bottleneck. The preconditioner is constructed from the top eigenpairs of the long-term covariance matrix through a randomized complex eigenvalue decomposition (RC-EVD), whose inner QR factorizations are realized via a Cholesky-based scheme (QRC), confining the dominant cost to generalized matrix multiplication (GEMM) and small triangular solves that map naturally onto systolic arrays. We further show that performing the preconditioned CG inversion in the beamspace domain induces sparsification of the system matrix and provides additional convergence acceleration at negligible transformation cost. Ray-tracing simulations confirm that the joint scheme reduces the required CG iteration count by two to three while matching the post-equalization SINR of the exact inversion.

eess.SP

Scalable Long-Term Beamforming for Massive Multi-User MIMO

Fully digital massive MIMO systems with large numbers (1000+) of antennas offer dramatically increased capacity gains from spatial multiplexing and beamforming. Designing digital receivers that can scale to these array dimensions presents significant challenges regarding both channel estimation overhead and digital computation. In the massive MIMO setting, long-term beamforming is widely-used since it offers significant reductions in both computation and channel estimation overhead. Long-term beamforming operates by projecting the data onto a low-dimensional subspace that can be tracked at a relatively slow time-scale from the long-term channel parameters. In this setting, we show how to optimally compute the projection matrix to maximize a capacity upper-bound using a matrix inverse square root. Computationally efficient methods are then presented to perform the matrix computation. The methods can be realized with matrix-matrix multiplies, making them amenable to systolic array implementations in hardware. Error analysis bounds on the degradation in the SINR for users are derived. Ray tracing simulations in a realistic rural uplink setting show minimal loss relative to complete instantaneous MMSE beamforming while offering significant overhead and computational gains.

eess.SP

Advancing Network Digital Twin Framework for Generating Realistic Datasets

The integration of accurate and reproducible wireless network simulations is a key enabler for research on open, virtualized, and intelligent communication systems. Network Digital Twins (NDTs) provide a scalable alternative to costly and time-consuming measurement campaigns, while enabling controlled experimentation and data generation for data-driven network design. In this paper, we present an open and user-friendly NDT framework that integrates controllable vehicular mobility with the site-specific ray tracer Sionna and the discrete-event ns-3 network simulator, enabling virtualized end-to-end modeling of wireless networks across the radio, network, and application layers. The proposed framework is particularly well-suited for dynamic vehicular networks and urban deployments, supporting realistic mobility, traffic dynamics, and the extraction of cross-layer metrics. To promote open-source initiatives, we release both the NDT implementation and a representative dataset generated from realistic vehicular and urban scenarios. The framework and dataset facilitate reproducible experimentation and benchmarking of machine learning-based quality of service prediction, network optimization, and intelligent network management algorithms, lowering the entry barrier for research on virtual and open wireless network services.

cs.NI

Interference Suppression for Massive MU-MIMO Long-Term Beamforming with Matrix Inversion Approximation

Long-term beamforming (LTBF) is a widely-used scalable alternative to instantaneous multi-user MIMO processing that leverages slowly varying spatial channel statistics. VLSI implementations require matrix inversion that become computationally challenging for massive MIMO systems with large number of antennas. In this work, we show that dominant interferers significantly degrade the numerical conditioning of the LTBF covariance matrix, leading to severe performance loss in finite-precision implementations of polynomial and conjugate gradient (CG) based inversion methods. To address this issue, we propose a subspace nulling approach that operates solely on long-term channel statistics and acts as an implicit preconditioning step for LTBF. By projecting the received signal onto the orthogonal complement of the dominant interference subspace, the proposed method reduces the eigenvalue spread of the covariance matrix and improves numerical stability. Through ray-tracing simulations in a realistic 5G scenario, we demonstrate that the proposed method substantially reduces the number of CG iterations required to achieve near-optimal performance across floating-point and fixed-point implementations while preserving the low-overhead nature of LTBF.

eess.SP

A Self-Calibrating SDR for High Fidelity Beam- and Null-forming Arrays

Null forming is increasingly essential in modern wireless systems for spectrum-sharing, anti-jamming, and covert communications in contested and congested environments. Achieving deep nulls, however, is far more demanding than conventional beam steering: nulls are intrinsically narrow, and even small phase, timing, or gain mismatches across RF chains can significantly degrade suppression. This work develops and validates a self-calibrating SDR architecture tailored for high-fidelity null forming using a compact reference transmitter directionally coupled to the antenna feeds. We demonstrate the effectiveness of the approach through simulation and experimental measurements on an SDR platform operating from 3.0 to 3.5GHz, a band of growing importance for Department of Defense spectrum-sharing initiatives.

eess.SP

Transformer-Based Rate Prediction for Multi-Band Cellular Handsets

Cellular wireless systems are facing a proliferation of frequency bands over a wide spectrum, particularly with the expansion into FR3. These bands must be supported in user equipment (UE) handsets with multiple antennas in a constrained form factor. Rapid variations in channel quality across the bands from motion and hand blockage, limited field-of-view of antennas, and hardware and power-constrained measurement sparsity pose significant challenges to reliable multi-band channel tracking. This paper formulates the problem of predicting achievable rates across multiple antenna arrays and bands with sparse historical measurements. We propose a transformer-based neural architecture that takes asynchronous rate histories as input and outputs per-array rate predictions. Evaluated on ray-traced simulations in a dense urban micro-cellular setting with FR1 and FR3 arrays, our method demonstrates superior performance over baseline predictors, enabling more informed band selection under realistic mobility and hardware constraints.

eess.SP

Compressed Multiband Sensing in FR3 Using Alternating Direction Method of Multipliers

Joint detection and localization of users and scatterers in multipath-rich channels on multiple bands is critical for integrated sensing and communication (ISAC) in 6G. Existing multiband sensing methods are limited by classical beamforming or computationally expensive approaches. This paper introduces alternating direction method of multipliers (ADMM)-assisted compressed multiband sensing (CMS), hereafter referred to as ADMM-CMS, which is a novel framework for multiband sensing using uplink quadrature amplitude modulation-modulated pilot symbols. To solve the CMS problem, we develop an adaptive ADMM algorithm that adjusts to noise and ensures automatic stopping if converged. ADMM combines the decomposability of dual ascent with the robustness of augmented Lagrangian methods, making it suitable for large-scale structured optimization. Simulations show that ADMM-CMS achieves higher spatial resolution and improved denoising compared to Bartlett-type beamforming, yielding a 34 dB gain in per-antenna transmit power for achieving a 0.9 successful recovery probability (SRP). Moreover, compared to performing compressed sensing separately on the constituent 7 GHz and 10 GHz sub-bands, ADMM-CMS achieves reductions in delay root mean squared error of 34.46% and 40.76%, respectively, at -41 dBm per-antenna transmit power, while also yielding improved SRP. Our findings demonstrate ADMM-CMS as an efficient enabler of ISAC in frequency range 3 (FR3, 7-24 GHz) for 6G systems.

eess.SP

Distributed Uplink Anti-Jamming in LEO Mega-Constellations via Game-Theoretic Beamforming

Low-Earth-Orbit (LEO) satellite constellations have become vital in emerging commercial and defense Non-Terrestrial Networks (NTNs). However, their predictable orbital dynamics and exposed geometries make them highly susceptible to ground-based jamming. Traditional single-satellite interference mitigation techniques struggle to spatially separate desired uplink signals from nearby jammers, even with large antenna arrays. This paper explores a distributed multi-satellite anti-jamming strategy leveraging the dense connectivity and high-speed inter-satellite links of modern LEO mega-constellations. We model the uplink interference scenario as a convex-concave game between a desired terrestrial transmitter and a jammer, each optimizing their spatial covariance matrices to maximize or minimize achievable rate. We propose an efficient min-max solver combining alternating best-response updates with projected gradient descent, achieving fast convergence of the beamforming strategy to the Nash equilibrium. Using realistic Starlink orbital geometries and Sionna ray-tracing simulations, we demonstrate that while close-proximity jammers can cripple single-satellite links, distributed satellite cooperation significantly enhances resilience, shifting the capacity distribution upward under strong interference.

eess.SP

Learning-Based Signal Recovery in Nonlinear Systems with Spectrally Separated Interference

Upper Mid-Band (FR3, 7-24 GHz) receivers for 6G must operate over wide bandwidths in dense spectral environments, making them particularly vulnerable to strong adjacent-band interference and front-end nonlinearities. While conventional linear receivers can suppress spectrally separated interferers under ideal hardware assumptions, receiver saturation and finite-resolution quantization cause nonlinear spectral leakage that severely degrades performance in practical wideband radios. We study the recovery of a desired signal from nonlinear receiver observations corrupted by a high-power out-of-band interferer. The receiver front-end is modeled as a smooth, memoryless nonlinearity followed by additive noise and optional quantization. To mitigate these nonlinear and quantization-induced distortions, we propose a learned multi-layer Vector Approximate Message Passing (LMLVAMP) algorithm that incorporates spectral priors with neural network based denoising. Simulation results demonstrate significant performance gains over conventional methods, particularly in high-interference regimes representative of FR3 coexistence scenarios.

eess.SP

Interpolation Techniques for Fast Channel Estimation in Ray Tracing

Ray tracing is increasingly utilized in wireless system simulations to estimate channel paths. In large-scale simulations with complex environments, ray tracing at high resolution can be computationally demanding. To reduce the computation, this paper presents a novel method for conducting ray tracing at a coarse set of reference points and interpolating the channels at other locations. The key insight is to interpolate the images of reflected points. In addition to the computational savings, the method directly captures the spherical nature of each wavefront enabling fast and accurate computation of channels using line-of-sight MIMO and other wide aperture techniques. Through empirical validation and comparison with exhaustive ray tracing, we demonstrate the efficacy and practicality of our approach in achieving high-fidelity channel predictions with reduced computational resources.

eess.SP

Exploring the Use of VLMs for Navigation Assistance for People with Blindness and Low Vision

This paper investigates the potential of vision-language models (VLMs) to assist people with blindness and low vision (pBLV) in navigation tasks. We evaluate state-of-the-art closed-source models, including GPT-4V, GPT-4o, Gemini-1.5-Pro, and Claude-3.5-Sonnet, alongside open-source models, such as Llava-v1.6-mistral and Llava-onevision-qwen, to analyze their capabilities in foundational visual skills: counting ambient obstacles, relative spatial reasoning, and common-sense wayfinding-pertinent scene understanding. We further assess their performance in navigation scenarios, using pBLV-specific prompts designed to simulate real-world assistance tasks. Our findings reveal notable performance disparities between these models: GPT-4o consistently outperforms others across all tasks, particularly in spatial reasoning and scene understanding. In contrast, open-source models struggle with nuanced reasoning and adaptability in complex environments. Common challenges include difficulties in accurately counting objects in cluttered settings, biases in spatial reasoning, and a tendency to prioritize object details over spatial feedback, limiting their usability for pBLV in navigation tasks. Despite these limitations, VLMs show promise for wayfinding assistance when better aligned with human feedback and equipped with improved spatial reasoning. This research provides actionable insights into the strengths and limitations of current VLMs, guiding developers on effectively integrating VLMs into assistive technologies while addressing key limitations for enhanced usability.

cs.CV

Computationally Efficient Signal Detection with Unknown Bandwidths

Signal detection in environments with unknown signal bandwidth and time intervals is a fundamental problem in adversarial and spectrum-sharing scenarios. This paper addresses the problem of detecting signals occupying unknown degrees of freedom from non-coherent power measurements, where the signal is constrained to an interval in one dimension or a hyper-cube in multiple dimensions. A GLRT is derived, resulting in a straightforward metric involving normalized average signal energy for each candidate signal set. We present bounds on false alarm and missed detection probabilities, demonstrating their dependence on SNR and signal set sizes. To overcome the inherent computational complexity of exhaustive searches, we propose a computationally efficient binary search method, reducing the complexity from O(N^2) to O(N) for one-dimensional cases. Simulations indicate that the method maintains performance near exhaustive searches and achieves asymptotic consistency, with interval-of-overlap converging to one under constant SNR as measurement size increases. The simulation studies also demonstrate superior performance and reduced complexity compared to contemporary neural network-based approaches, specifically outperforming custom-trained U-Net models in spectrum detection tasks.

eess.SP

A Spatial Array for Spectrally Agile Wireless Processing

Massive MIMO is a cornerstone of next-generation wireless communication, offering significant gains in capacity, reliability, and energy efficiency. However, to meet emerging demands such as high-frequency operation, wide bandwidths, co-existence, integrated sensing, and resilience to dynamic interference, future systems must exhibit both scalability and spectral agility. These requirements place increasing pressure on the underlying processing hardware to be both efficient and reconfigurable. This paper proposes a custom-designed spatial array architecture that serves as a reconfigurable, general-purpose core optimized for a class of wireless kernels that commonly arise in diverse communications and sensing tasks. The proposed spatial array is evaluated against specialized cores for each kernel using High-Level Synthesis (HLS). Both the reconfigurable and specialized designs are synthesized in a 32 nm process to assess latency, throughput, area, and power in realistic processes. The results identify conditions under which general-purpose systolic architectures can approach the efficiency of specialized cores, thereby paving the way toward more scalable and agile systems.

eess.SP