Searcharxiv⌕ Search

arXiv subjects

R. Michael Buehrer

Publications and source records attributed to R. Michael Buehrer.

At least 55 records · Page 3Linked to original sources
arXiv2023

Mode Selection and Target Classification in Cognitive Radar Networks

Cognitive Radar Networks were proposed by Simon Haykin in 2006 to address problems with large legacy radar implementations - primarily, single-point vulnerabilities and lack of adaptability. This work proposes to leverage the adaptability of cognitive radar networks to trade between active radar observation, which uses high power and risks interception, and passive signal parameter estimation, which uses target emissions to gain side information and lower the power necessary to accurately track multiple targets. The goal of the network is to learn over many target tracks both the characteristics of the targets as well as the optimal action choices for each type of target. In order to select between the available actions, we utilize a multi-armed bandit model, using current class information as prior information. When the active radar action is selected, the node estimates the physical behavior of targets through the radar emissions. When the passive action is selected, the node estimates the radio behavior of targets through passive sensing. Over many target tracks, the network collects the observed behavior of targets and forms clusters of similarly-behaved targets. In this way, the network meta-learns the target class distributions while learning the optimal mode selections for each target class.

eess.SP↗
arXiv2023

NTN-based 6G Localization: Vision, Role of LEOs, and Open Problems

Since the introduction of 5G Release 18, non-terrestrial networks (NTNs) based positioning has garnered significant interest due to its numerous applications, including emergency services, lawful intercept, and charging and tariff services. This release considers single low-earth-orbit (LEO) positioning explicitly for $\textit{location verification}$ purposes, which requires a fairly coarse location estimate. To understand the future trajectory of NTN-based localization in 6G, we first provide a comprehensive overview of the evolution of 3rd Generation Partnership Project (3GPP) localization techniques, with specific emphasis on the current activities in 5G related to NTN location verification. We then delineate the suitability of LEOs for location-based services and emphasize increased interest in LEO-based positioning. In order to provide support for more accurate positioning in 6G using LEOs, we identify two NTN positioning systems that are likely study items for 6G: (i) multi-LEO positioning, and (ii) augmenting single-LEO and multi-LEO setups with Global Navigation Satellite System (GNSS), especially when an insufficient number of GNSS satellites (such as 2) are visible. We evaluate the accuracy of both systems through a 3GPP-compliant simulation study using a Cramér-Rao lower bound (CRLB) analysis. Our findings suggest that NTN technology has significant potential to provide accurate positioning of UEs in scenarios where GNSS signals may be weak or unavailable, but there are technical challenges in accommodating these solutions in 3GPP. We conclude with a discussion on the research landscape and key open problems related to NTN-based positioning.

cs.IT↗
arXiv2023

On the Value of Online Learning for Radar Waveform Selection

This paper attempts to characterize the kinds of physical scenarios in which an online learning-based cognitive radar is expected to reliably outperform a fixed rule-based waveform selection strategy, as well as the converse. We seek general insights through an examination of two decision-making scenarios, namely dynamic spectrum access and multiple-target tracking. The radar scene is characterized by inducing a state-space model and examining the structure of its underlying Markov state transition matrix, in terms of entropy rate and diagonality. It is found that entropy rate is a strong predictor of online learning-based waveform selection, while diagonality is a better predictor of fixed rule-based waveform selection. We show that these measures can be used to predict first and second-order stochastic dominance relationships, which can allow system designers to make use of simple decision rules instead of more cumbersome learning approaches under certain conditions. We validate our findings through numerical results for each application and provide guidelines for future implementations.

eess.SP↗
arXiv2023

Fundamentals of RIS-Aided Localization in the Far-Field

This paper develops fundamental bounds for localization in orthogonal frequency division multiplexing (OFDM) systems aided by reconfigurable intelligent surfaces (RISs). Specifically, we start from the assumption that the position and orientation of a RIS can be viewed as prior information for RIS-aided localization in wireless systems and derive Bayesian bounds for the localization of a user equipment (UE). To do this, we first derive the Bayesian Fisher information matrix (FIM) for channel parameters to derive the Bayesian localization bounds. Then, to focus on the geometric channel parameters, we derive the equivalent Fisher information matrix (EFIM) and show that it has a definite structure. Subsequently, we show through the information loss associated with the EFIM that when the RIS reflection coefficients remain constant across all OFDM symbols, and there is no prior information about the nuisance parameters, the corresponding submatrix in the EFIM related to the RIS angle parameters is a zero matrix. As a result of the EFIM being a zero matrix, estimating the RIS-related angle channel parameters is not possible when the RIS reflection coefficients remain constant across all OFDM symbols. This observation is crucial for the estimation of the RIS-related angle parameters. It dictates that to estimate the RIS-related angle parameters, there must be more than one OFDM transmission with differing RIS reflection coefficients.

eess.SP↗
arXiv2023

RIS-Aided Localization under Position and Orientation Offsets in the Near and Far Field

This paper presents a rigorous Bayesian analysis of the information in the signal (consisting of both the line-of-sight (LOS) path and reflections from multiple reconfigurable intelligent surfaces (RISs)) that originate from a single base station (BS) and is received by a user equipment (UE). For a comprehensive Bayesian analysis, both near and far field regimes are considered. The Bayesian analysis views both the location of the RISs and previous information about the UE as {\em a priori} information for UE localization. With outdated {\em a priori} information, the position and orientation offsets of the RISs become parameters that need to be estimated and fed back to the BS for correction. We first show that when the RIS elements have a half wavelength spacing, this RIS orientation offset is a factor in the pathloss of the RIS paths. Subsequently, we show through the Bayesian equivalent Fisher information matrix (EFIM) for the channel parameters that the RIS orientation offset cannot be corrected when there is an unknown phase offset in the received signal in the far-field regime. However, the corresponding EFIM for the channel parameters in the received signal observed in the near-field shows that this unknown phase offset does not hinder the estimation of the RIS orientation offset when the UE has more than one receive antenna. Furthermore, we use the EFIM for the UE location parameters to present bounds for UE localization in the presence of RIS uncertainty.

cs.IT↗
arXiv2023

On the Limits of Single Anchor Localization: Near-Field vs Far-Field

It is well known that a single anchor can be used to determine the position and orientation of an agent communicating with it. However, it is not clear what information about the anchor or the agent is necessary to perform this localization, especially when the agent is in the near-field of the anchor. Hence, in this paper, to investigate the limits of localizing an agent with some uncertainty in the anchor location, we consider a wireless link consisting of source and destination nodes. More specifically, we present a Fisher information theoretical investigation of the possibility of estimating different combinations of the source and destination's position and orientation from the signal received at the destination. To present a comprehensive study, we perform this Fisher information theoretic investigation under both the near and far field propagation models. One of the key insights is that while the source or destination's $3$D orientation can be jointly estimated with the source or destination's $3$D position in the near-field propagation regime, only the source or destination's $2$D orientation can be jointly estimated with the source or destination's $2$D position in the far-field propagation regime. Also, a simulation of the FIM indicates that in the near-field, we can estimate the source's $3$D orientation angles with no beamforming, but in the far-field, we can not estimate the source's $2$D orientation angles when no beamforming is employed.

cs.IT↗
arXiv2023

RIS-Aided Kinematic Analysis for Remote Rehabilitation

This paper is the first to introduce the idea of using reconfigurable intelligent surfaces (RISs) as passive devices that measure the position and orientation of certain human body parts over time. In this paper, we investigate the possibility of utilizing the available geometric information provided by on-body RISs that reflect signals from an off-body transmitter to an off-body receiver for stroke rehabilitation. More specifically, we investigate the possibility of using on-body RISs to estimate the location information over time of upper limbs that may have been impaired due to stroke. This location information can help medical professionals to estimate the possibly time varying pose and obtain progress on the rehabilitation of the upper limbs. Our analysis is focused on two scenarios: i) after assessment exercises for stroke rehabilitation when the upper limbs are resting at predefined points in the rehabilitation center, and ii) during the assessment exercises. In the first scenario, we explore the possibility of upper limb orientation estimation by deriving the Fisher information matrix (FIM) under near-field and far-field propagation conditions. It is noteworthy that the FIM quantifies how accurately we can estimate location information from a signal, and any subsequent algorithm is bounded by a function of the FIM. Coming to our propagation assumptions, the difference between the near-field and far-field regimes lies in the curvature of the wavefront. In the near-field, a receiver experiences a spherical wavefront, whereas in the far-field, the wavefront is approximately linear. The threshold to be within the near-field can be on the order of $10 \text{ m}.$

eess.SP↗
arXiv2023

Hybrid Cognition for Target Tracking in Cognitive Radar Networks

This work investigates online learning techniques for a cognitive radar network utilizing feedback from a central coordinator. The available spectrum is divided into channels, and each radar node must transmit in one channel per time step. The network attempts to optimize radar tracking accuracy by learning the optimal channel selection for spectrum sharing and radar performance. We define optimal selection for such a network in relation to the radar observation quality obtainable in a given channel. This is a difficult problem since the network must seek the optimal assignment from nodes to channels, rather than just seek the best overall channel. Since the presence of primary users appears as interference, the approach also improves spectrum sharing performance. In other words, maximizing radar performance also minimizes interference to primary users. Each node is able to learn the quality of several available channels through repeated sensing. We define hybrid cognition as the condition where both the independent radar nodes as well as the central coordinator are modeled as cognitive agents, with restrictions on the amount of information that can be exchanged between the radars and the coordinator. Importantly, each part of the network acts as an online learner, observing the environment to inform future actions. We show that in interference-limited spectrum, where the signal-to-interference-plus-noise ratio varies by channel and over time for a target with fixed radar cross section, a cognitive radar network is able to use information from the central coordinator in order to reduce the amount of time necessary to learn the optimal channel selection. We also show that even limited use of a central coordinator can eliminate collisions, which occur when two nodes select the same channel.

eess.SY↗
arXiv2023

Line-of-Sight Probability for Outdoor-to-Indoor UAV-Assisted Emergency Networks

For emergency response scenarios like firefighting in urban environments, there is a need to both localize emergency responders inside the building and also support a high bandwidth communication link between the responders and a command-and-control center. The emergency networks for such scenarios can be established with the quick deployment of Unmanned Aerial Vehicles (UAVs). Further, the 3D mobility of UAVs can be leveraged to improve the quality of the wireless link by maneuvering them into advantageous locations. This has motivated recent propagation measurement campaigns to study low-altitude air-to-ground channels in both 5G-sub6 GHz and 5G-mmWave bands. In this paper, we develop a model for the link in a UAV-assisted emergency location and/or communication system. Specifically, given the importance of Line-of-Sight (LoS) links in localization as well as mmWave communication, we derive a closed-form expression for the LoS probability. This probability is parameterized by the UAV base station location, the size of the building, and the size of the window that offers the best propagation path. An expression for coverage probability is also derived. The LoS probability and coverage probabilities derived in this paper can be used to analyze the outdoor UAV-to-indoor propagation environment to determine optimal UAV positioning and the number of UAVs needed to achieve the desired performance of the emergency network.

eess.SP↗
arXiv2023

Timely Target Tracking in Cognitive Radar Networks

We consider a scenario where a fusion center must decide which updates to receive during each update period in a communication-limited cognitive radar network. When each radar node in the network only is able to obtain noisy state measurements for a subset of the targets, the fusion center may not receive updates on every target during each update period. The solution for the selection problem at the fusion center is not well suited for sequential learning frameworks. We derive an Age of Information-inspired track sensitive metric to inform node selection in such a network and compare it against less-informed techniques.

eess.SY↗
arXiv2023

Online Bayesian Meta-Learning for Cognitive Tracking Radar

A key component of cognitive radar is the ability to generalize, or achieve consistent performance across a range of sensing environments, since aspects of the physical scene may vary over time. This presents a challenge for learning-based waveform selection approaches, since transmission policies which are effective in one scene may be highly suboptimal in another. We address this problem by strategically biasing a learning algorithm by exploiting high-level structure across tracking instances, referred to as meta-learning. In this work, we develop an online meta-learning approach for waveform-agile tracking. This approach uses information gained from previous target tracks to speed up and enhance learning in new tracking instances. This results in sample-efficient learning across a class of finite state target channels by exploiting inherent similarity across tracking scenes, attributed to common physical elements such as target type or clutter statistics. We formulate the online waveform selection problem within the framework of Bayesian learning, and provide prior-dependent performance bounds for the meta-learning problem using Probability Approximately Correct (PAC)-Bayes theory. We present a computationally feasible meta-posterior sampling algorithm and study the performance in a simulation study consisting of diverse scenes. Finally, we examine the potential performance benefits and practical challenges associated with online meta-learning for waveform-agile tracking.

cs.IT↗
arXiv2023

Open Set Wireless Signal Classification: Augmenting Deep Learning with Expert Feature Classifiers

In shared spectrum with multiple radio access technologies, wireless standard classification is vital for applications such as dynamic spectrum access (DSA) and wideband spectrum monitoring. However, interfering signals and the presence of unknown classes of signals can diminish classification accuracy. To reduce interference, signals can be isolated in time, frequency, and space, but the isolation process adds distortion that reduces the accuracy of deep learning classifiers. We find that the distortion can be partially mitigated by augmenting the classifier training data with the signal isolation steps. To address unknown signals, we propose an open set hybrid classifier, which combines deep learning and expert feature classifiers to leverage the reliability and explainability of expert feature classifiers and the lower computational complexity of deep learning classifiers. The hybrid classifier reduces the computational complexity by 2 to 7 times on average compared to the expert feature classifiers, while achieving an accuracy of 95% at 15 dB SNR for known signal classes. The hybrid classifier manages to detect unknown classes at nearly 100% accuracy, due to the robustness of the expert feature classifiers.

eess.SP↗
arXiv2022

When is Cognitive Radar Beneficial?

When should an online reinforcement learning-based frequency agile cognitive radar be expected to outperform a rule-based adaptive waveform selection strategy? We seek insight regarding this question by examining a dynamic spectrum access scenario, in which the radar wishes to transmit in the widest unoccupied bandwidth during each pulse repetition interval. Online learning is compared to a fixed rule-based sense-and-avoid strategy. We show that given a simple Markov channel model, the problem can be examined analytically for simple cases via stochastic dominance. Additionally, we show that for more realistic channel assumptions, learning-based approaches demonstrate greater ability to generalize. However, for short time-horizon problems that are well-specified, we find that machine learning approaches may perform poorly due to the inherent limitation of convergence time. We draw conclusions as to when learning-based approaches are expected to be beneficial and provide guidelines for future study.

cs.IT↗
arXiv2022

Online Learning-based Waveform Selection for Improved Vehicle Recognition in Automotive Radar

This paper describes important considerations and challenges associated with online reinforcement-learning based waveform selection for target identification in frequency modulated continuous wave (FMCW) automotive radar systems. We present a novel learning approach based on satisficing Thompson sampling, which quickly identifies a waveform expected to yield satisfactory classification performance. We demonstrate through measurement-level simulations that effective waveform selection strategies can be quickly learned, even in cases where the radar must select from a large catalog of candidate waveforms. The radar learns to adaptively select a bandwidth for appropriate resolution and a slow-time unimodular code for interference mitigation in the scene of interest by optimizing an expected classification metric.

eess.SP↗
arXiv2022

Model Order Estimation in the Presence of multipath Interference using Residual Convolutional Neural Networks

Model order estimation (MOE) is often a pre-requisite for Direction of Arrival (DoA) estimation. Due to limits imposed by array geometry, it is typically not possible to estimate spatial parameters for an arbitrary number of sources; an estimate of the signal model is usually required. MOE is the process of selecting the most likely signal model from several candidates. While classic methods fail at MOE in the presence of coherent multipath interference, data-driven supervised learning models can solve this problem. Instead of the classic MLP (Multiple Layer Perceptions) or CNN (Convolutional Neural Networks) architectures, we propose the application of Residual Convolutional Neural Networks (RCNN), with grouped symmetric kernel filters to deliver state-of-art estimation accuracy of up to 95.2\% in the presence of coherent multipath, and a weighted loss function to eliminate underestimation error of the model order. We show the benefit of the approach by demonstrating its impact on an overall signal processing flow that determines the number of total signals received by the array, the number of independent sources, and the association of each of the paths with those sources . Moreover, we show that the proposed estimator provides accurate performance over a variety of array types, can identify the overloaded scenario, and ultimately provides strong DoA estimation and signal association performance.

eess.SP↗
arXiv2022

Distributed Online Learning for Coexistence in Cognitive Radar Networks

This work addresses the coexistence problem for radar networks. Specifically, we model a network of cooperative, independent, and non-communicating radar nodes which must share resources within the network as well as with non-cooperative nearby emitters. We approach this problem using online Machine Learning (ML) techniques. Online learning approaches are specifically preferred due to the fact that each radar node has no prior knowledge of the environment nor of the positions of the other radar nodes, and due to the sequential nature of the problem. For this task we specifically select the multi-player multi-armed bandit (MMAB) model, which poses the problem as a sequential game, where each radar node in a network makes independent selections of center frequency and waveform with the same goal of improving tracking performance for the network as a whole. For accurate tracking, each radar node communicates observations to a fusion center on set intervals. The fusion center has knowledge of the radar node placement, but cannot communicate to the individual nodes fast enough for waveform control. Every radar node in the network must learn the behavior of the environment, which includes rewards, interferer behavior, and target behavior. Our contributions include a mathematical description of the MMAB framework adapted to the radar network scenario. We conclude with a simulation study of several different network configurations. Experimental results show that iterative, online learning using MMAB outperforms the more traditional sense-and-avoid (SAA) and fixed-allocation approaches.

eess.SP↗
arXiv2022

Decentralized Bandits with Feedback for Cognitive Radar Networks

Completely decentralized Multi-Player Bandit models have demonstrated high localization accuracy at the cost of long convergence times in cognitive radar networks. Rather than model each radar node as an independent learner, entirely unable to swap information with other nodes in a network, in this work we construct a "central coordinator" to facilitate the exchange of information between radar nodes. We show that in interference-limited spectrum, where the signal to interference plus noise (SINR) ratio for the available bands may vary by location, a cognitive radar network (CRN) is able to use information from a central coordinator to reduce the number of time steps required to attain a given localization error. Importantly, each node is still able to learn separately. We provide a description of a network which has hybrid cognition in both a central coordinator and in each of the cognitive radar nodes, and examine the online machine learning algorithms which can be implemented in this structure.

eess.SP↗
arXiv2022

Linear Jamming Bandits: Sample-Efficient Learning for Non-Coherent Digital Jamming

It has been shown (Amuru et al. 2015) that online learning algorithms can be effectively used to select optimal physical layer parameters for jamming against digital modulation schemes without a priori knowledge of the victim's transmission strategy. However, this learning problem involves solving a multi-armed bandit problem with a mixed action space that can grow very large. As a result, convergence to the optimal jamming strategy can be slow, especially when the victim and jammer's symbols are not perfectly synchronized. In this work, we remedy the sample efficiency issues by introducing a linear bandit algorithm that accounts for inherent similarities between actions. Further, we propose context features which are well-suited for the statistical features of the non-coherent jamming problem and demonstrate significantly improved convergence behavior compared to the prior art. Additionally, we show how prior knowledge about the victim's transmissions can be seamlessly integrated into the learning framework. We finally discuss limitations in the asymptotic regime.

cs.LG↗