arXiv subjects

Sanjeev Gurugopinath

Publications and source records attributed to Sanjeev Gurugopinath.

10 recordsLinked to original sources

arXiv2026

RIS-Assisted Radar-Communication Coexistence: Detection Analysis with Channel Uncertainties

Reconfigurable intelligent surfaces (RISs) have emerged as a promising technology for improving communication reliability in radar-communication coexistence (RCC) scenarios, particularly for communication users (CUs) located inside radar exclusion zones, where only the radar is permitted to operate and the two systems remain uncoordinated. In such settings, CUs may suffer from strong radar interference whose phase is random and difficult to track while also facing difficulty in obtaining accurate CSI from the base station. These challenges become even more critical in the presence of RIS phase errors, which limit the applicability of conventional coherent detection methods. Motivated by these practical limitations, this paper develops an RIS-assisted RCC framework for a CU operating in an uncoordinated RCC setting. Within this framework, we derive two practical maximum-likelihood (ML)-based detectors, both of which avoid tracking the radar interference phase: 1) a non-coherent detector that does not require instantaneous CSI and incorporates RIS phase uncertainty, and 2) a mismatched coherent detector that relies on imperfect CSI. For the non-coherent case, we derive an exact likelihood expression and a closed-form detector in the low to moderate SINR regime. For the imperfect CSI case, we derive the corresponding closed-form detector in the low-to-moderate SINR regime, and analyze performance through pairwise error probability (PEP), yielding a tractable approximation based on Gauss-Chebyshev quadrature. Numerical and analytical results show that the proposed non-coherent detector closely matches the optimal ML detector, validating its practical usefulness.

eess.SP↗

arXiv2021

Radar Information Theory for Joint Communication and Parameter Estimation with Passive Targets

In this paper, we derive the information theoretic performance bounds on communication data rates and errors in parameter estimation, for a joint radar and communication (JRC) system. We assume that targets are semi-passive, i.e. they use active components for signal reception, and passive components to communicate their own information. Specifically, we let the targets to have control over their passive reflectors in order to transmit their own information back to the radar via reflection-based beamforming or backscattering. We derive the Cramer-Rao lower bounds (CRBs) for the mean squared error in the estimation of target parameters. The concept of a target ambiguity function (TAF) arises naturally in the derivation CRBs. Using these TAFs as cost function, we propose a waveform optimization technique based on calculus of variations. Further, we derive lower bounds on the data rates for communication on forward and reverse channels, in radar-only and joint radar and communications scenarios. Through numerical examples, we demonstrate the utility of this framework for transmit waveform design, codebook construction, and establishing the corresponding data rate bounds.

cs.IT↗

arXiv2021

A Survey on Machine Learning Algorithms for Applications in Cognitive Radio Networks

In this paper, we present a survey on the utility of machine learning (ML) algorithms for applications in cognitive radio networks (CRN). We start with a high-level overview of some of the major challenges in CRNs, and mention the ML architectures and algorithms that can be used to alleviate them. In particular, our focus is on two fundamental applications in CRNs, namely spectrum sensing -- with non-cooperative and cooperative scenarios, and dynamic spectrum access -- with spectrum auction and prediction. We present a detailed study of recent advancements in the field of ML in CRNs for these applications, and briefly discuss the set of challenges in real-time implementation of ML techniques for CRNs.

eess.SP↗

arXiv2021

Interplay Between NOMA and GSSK: Detection Strategies and Performance Analysis

Non-orthogonal multiple access (NOMA) is a technology enabler for the fifth generation and beyond networks, which has shown a great flexibility such that it can be readily integrated with other wireless technologies. In this paper, we investigate the interplay between NOMA and generalized space shift keying (GSSK) in a hybrid NOMA-GSSK (N-GSSK) network. Specifically, we provide a comprehensive analytical framework and propose a novel suboptimal energy-based maximum likelihood (ML) detector for the N-GSSK scheme. The proposed ML decoder exploits the energy of the received signals in order to estimate the active antenna indices. Its performance is investigated in terms of pairwise error probability, bit error rate union bound, and achievable rate. Finally, we establish the validity of our analysis through Monte-Carlo simulations and demonstrate that N-GSSK outperforms conventional NOMA and GSSK, particularly in terms of spectral efficiency.

cs.IT↗

arXiv2020

Non-Orthogonal Multiple Access in the Presence of Additive Generalized Gaussian Noise

In this letter, we investigate the performance of non-orthogonal multiple access (NOMA), under the assumption of generalized Gaussian noise (GGN), over Rayleigh fading channels. Specifically, we consider a NOMA system with $L$ users, each of which is equipped with a single antenna, and derive an exact expression for the pairwise error probability (PEP). The derived PEP expression is subsequently utilized to derive a union bound on the bit error rate (BER) and to quantify the diversity orders realized by NOMA users in the presence of additive white (AW) GGN. Capitalizing on the derived PEP expression and the union bound, the error rate performance of NOMA users is further evaluated for different special cases of AWGGN. The derived analytical results, corroborated by simulation results, show that the shaping parameter of the GGN $(α)$ has negligible effect on the diversity gains of NOMA users, particularly for large $α$ values. Accordingly, as in the case of additive white Gaussian noise (AWGN), the maximum achievable diversity order is determined by the user's order.

eess.SP↗

arXiv2020

Non-Orthogonal Multiple Access with Wireless Caching for 5G-Enabled Vehicular Networks

The proliferation of connected vehicles along with the high demand for rich multimedia services constitute key challenges for the emerging 5G-enabled vehicular networks. These challenges include, but are not limited to, high spectral efficiency and low latency requirements. Recently, the integration of cache-enabled networks with non-orthogonal multiple access (NOMA) has been shown to reduce the content delivery time and traffic congestion in wireless networks. Ac-cordingly, in this article, we envisage cache-aided NOMA as a technology facilitator for 5G-enabled vehicular networks. In particular, we present a cache-aided NOMA architecture, which can address some of the aforementioned challenges in these networks. We demonstrate that the spectral efficiency gain of the proposed architecture, which depends largely on the cached contents, significantly outperforms that of conventional vehicular networks. Finally, we provide deep insights into the challenges, opportunities, and future research trends that will enable the practical realization of cache-aided NOMA in 5G-enabled vehicular networks.

cs.IT↗

arXiv2019

Cache-Aided Non-Orthogonal Multiple Access for 5G-Enabled Vehicular Networks

The increasing demand for rich multimedia services and the emergence of the Internet-of-Things (IoT) pose challenging requirements for the next generation vehicular networks. Such challenges are largely related to high spectral efficiency and low latency requirements in the context of massive content delivery and increased connectivity. In this respect, caching and non-orthogonal multiple access (NOMA) paradigms have been recently proposed as potential solutions to effectively address some of these key challenges. In the present contribution, we introduce cache-aided NOMA as an enabling technology for vehicular networks. In this context, we first consider the full file caching case, where each vehicle caches and requests entire files using the NOMA principle. Without loss of generality, we consider a two-user vehicular network communication scenario under double Nakagami$-m$ fading conditions and propose an optimum power allocation policy. To this end, an optimization problem that maximizes the overall probability of successful decoding of files at each vehicle is formulated and solved. Furthermore, we consider the case of split file caching, where each file is divided into two parts. A joint power allocation optimization problem is formulated, where power allocation across vehicles and cached split files is investigated. The offered analytic results are corroborated by extensive results from computer simulations and interesting insights are developed. Indicatively, it is shown that the proposed caching-aided NOMA outperforms the conventional NOMA technique.

eess.SP↗

arXiv2019

Energy Efficiency Analysis of Collaborative Compressive Sensing Scheme in Cognitive Radio Networks

In this paper, we investigate the energy efficiency of conventional collaborative compressive sensing (CCCS) scheme, focusing on balancing the tradeoff between energy efficiency and detection accuracy in cognitive radio environment. In particular, we derive the achievable throughput, energy consumption and energy efficiency of the CCCS scheme, and formulate an optimization problem to determine the optimal values of parameters which maximize the energy efficiency of the CCCS scheme. The maximization of energy efficiency is proposed as a multi-variable, non-convex optimization problem, and we provide approximations to reduce it to a convex optimization problem. We highlight that errors due to these approximations are negligible. Later, we analytically characterize the tradeoff between dimensionality reduction and collaborative sensing performance of the CCCS scheme -- the implicit tradeoff between energy saving and detection accuracy, and show that the loss due to compression can be recovered through collaboration which improves the overall energy efficiency.

cs.IT↗

arXiv2019

Opportunistic Ambient Backscatter Communication in RF-Powered Cognitive Radio Networks

In the present contribution, we propose a novel opportunistic ambient backscatter communication (ABC) framework for radio frequency (RF)-powered cognitive radio (CR) networks. This framework considers opportunistic spectrum sensing integrated with ABC and harvest-then-transmit (HTT) operation strategies. Novel analytic expressions are derived for the average throughput, the average energy consumption and the energy efficiency in the considered set up. These expressions are represented in closed-form and have a tractable algebraic representation which renders them convenient to handle both analytically and numerically. In addition, we formulate an optimization problem to maximize the energy efficiency of the CR system operating in mixed ABC $-$ and HTT $-$ modes, for a given set of constraints including primary interference and imperfect spectrum sensing constraints. Capitalizing on this, we determine the optimal set of parameters which in turn comprise the optimal detection threshold, the optimal degree of trade-off between the CR system operating in the ABC $-$ and HTT $-$ modes and the optimal data transmission time. Extensive results from respective computer simulations are also presented for corroborating the corresponding analytic results and to demonstrate the performance gain of the proposed model in terms of energy efficiency.

cs.IT↗

arXiv2019

Sensing-Throughput Tradeoff for Superior Selective Reporting-based Spectrum Sensing in Energy Harvesting HCRNs

In this paper, we investigate the performance of conventional cooperative sensing (CCS) and superior selective reporting (SSR)-based cooperative sensing in an energy harvesting-enabled heterogeneous cognitive radio network (HCRN). In particular, we derive expressions for the achievable throughput of both schemes and formulate nonlinear integer programming problems, in order to find the throughput-optimal set of spectrum sensors scheduled to sense a particular channel, given primary user (PU) interference and energy harvesting constraints. Furthermore, we present novel solutions for the underlying optimization problems based on the cross-entropy (CE) method, and compare the performance with exhaustive search and greedy algorithms. Finally, we discuss the tradeoff between the average achievable throughput of the SSR and CCS schemes, and highlight the regime where the SSR scheme outperforms the CCS scheme. Notably, we show that there is an inherent tradeoff between the channel available time and the detection accuracy. Our numerical results show that, as the number of spectrum sensors increases, the channel available time gains a higher priority in an HCRN, as opposed to detection accuracy.

cs.IT↗