arXiv subjects

R. Michael Buehrer

Publications and source records attributed to R. Michael Buehrer.

At least 73 records · Page 4Linked to original sources

arXiv2022

Weight Selection for Pattern Control of Paraboloidal Reflector Antennas with Reconfigurable Rim Scattering

It has been recently demonstrated that modifying the rim scattering of a paraboloidal reflector antenna through the use of reconfigurable elements along the rim facilitates sidelobe modification including cancelling sidelobes. In this work we investigate techniques for determining the unit-magnitude weights (i.e., weights which modify the phase of the scattered signals) to accomplish sidelobe cancellation at arbitrary angles from the reflector axis. Specifically, it is shown that despite the large search space and the non-convexity of the cost function, weights can be found with reasonable complexity which provide significant cancellation capability. First, the optimal weights without any magnitude constraints are found. Afterwards, algorithms are developed for determining the unit-modulus weights with both quantized and unquantized phases. Further, it is shown that weights can be obtained that both cancel sidelobes while providing a constant main lobe gain. A primary finding is that sufficiently deep nulls are possible with essentially no change in the main lobe with practical (binary or quaternary) phase-only weights.

eess.SP↗

arXiv2022

Universal Learning Waveform Selection Strategies for Adaptive Target Tracking

Online selection of optimal waveforms for target tracking with active sensors has long been a problem of interest. Many conventional solutions utilize an estimation-theoretic interpretation, in which a waveform-specific Cramér-Rao lower bound on measurement error is used to select the optimal waveform for each tracking step. However, this approach is only valid in the high SNR regime, and requires a rather restrictive set of assumptions regarding the target motion and measurement models. Further, due to computational concerns, many traditional approaches are limited to near-term, or myopic, optimization, even though radar scenes exhibit strong temporal correlation. More recently, reinforcement learning has been proposed for waveform selection, in which the problem is framed as a Markov decision process (MDP), allowing for long-term planning. However, a major limitation of reinforcement learning is that the memory length of the underlying Markov process is often unknown for realistic target and channel dynamics, and a more general framework is desirable. This work develops a universal sequential waveform selection scheme which asymptotically achieves Bellman optimality in any radar scene which can be modeled as a $U^{\text{th}}$ order Markov process for a finite, but unknown, integer $U$. Our approach is based on well-established tools from the field of universal source coding, where a stationary source is parsed into variable length phrases in order to build a context-tree, which is used as a probabalistic model for the scene's behavior. We show that an algorithm based on a multi-alphabet version of the Context-Tree Weighting (CTW) method can be used to optimally solve a broad class of waveform-agile tracking problems while making minimal assumptions about the environment's behavior.

cs.IT↗

arXiv2022

Multi-Band Wi-Fi Sensing with Matched Feature Granularity

Complementary to the fine-grained channel state information (CSI) from the physical layer and coarse-grained received signal strength indicator (RSSI) measurements, the mid-grained spatial beam attributes (e.g., beam SNR) that are available at millimeter-wave (mmWave) bands during the mandatory beam training phase can be repurposed for Wi-Fi sensing applications. In this paper, we propose a multi-band Wi-Fi fusion method for Wi-Fi sensing that hierarchically fuses the features from both the fine-grained CSI at sub-6 GHz and the mid-grained beam SNR at 60 GHz in a granularity matching framework. The granularity matching is realized by pairing two feature maps from the CSI and beam SNR at different granularity levels and linearly combining all paired feature maps into a fused feature map with learnable weights. To further address the issue of limited labeled training data, we propose an autoencoder-based multi-band Wi-Fi fusion network that can be pre-trained in an unsupervised fashion. Once the autoencoder-based fusion network is pre-trained, we detach the decoders and append multi-task sensing heads to the fused feature map by fine-tuning the fusion block and re-training the multi-task heads from the scratch. The multi-band Wi-Fi fusion framework is thoroughly validated by in-house experimental Wi-Fi sensing datasets spanning three tasks: 1) pose recognition; 2) occupancy sensing; and 3) indoor localization. Comparison to four baseline methods (i.e., CSI-only, beam SNR-only, input fusion, and feature fusion) demonstrates the granularity matching improves the multi-task sensing performance. Quantitative performance is evaluated as a function of the number of labeled training data, latent space dimension, and fine-tuning learning rates.

cs.NI↗

arXiv2021

Differential Modulation in Massive MIMO With Low-Resolution ADCs

In this paper, we present a differential modulation and detection scheme for use in the uplink of a system with a large number of antennas at the base station, each equipped with low-resolution analog-to-digital converters (ADCs). We derive an expression for the maximum likelihood (ML) detector of a differentially encoded phase information symbol received by a base station operating in the low-resolution ADC regime. We also present an equal performing reduced complexity receiver for detecting the phase information. To increase the supported data rate, we also present a maximum likelihood expression to detect differential amplitude phase shift keying symbols with low-resolution ADCs. We note that the derived detectors are unable to detect the amplitude information. To overcome this limitation, we use the Bussgang Theorem and the Central Limit Theorem (CLT) to develop two detectors capable of detecting the amplitude information. We numerically show that while the first amplitude detector requires multiple quantization bits for acceptable performance, similar performance can be achieved using one-bit ADCs by grouping the receive antennas and employing variable quantization levels (VQL) across distinct antenna groups. We validate the performance of the proposed detectors through simulations and show a comparison with corresponding coherent detectors. Finally, we present a complexity analysis of the proposed low-resolution differential detectors

eess.SP↗

arXiv2021

Differential Deep Detection in Massive MIMO With One-Bit ADC

This article presents a differential detection scheme for the uplink of a massive MIMO system that employs one-bit quantizers on each receive antenna. We focus on the detection of differential amplitude and phase shift keying symbols and we use the Bussgang theorem to express the quantized received signal in terms of quantized signals received during previous channel uses. Subsequently, we derive the maximum likelihood detector for the differentially encoded amplitude and phase information symbols. We note that while the one-bit detector can decode the differentially encoded phase information symbols, it fails to decode the differentially encoded amplitude information. To decode the amplitude information, we present a one-bit variable quantization level (VQL) system and train a deep neural network to perform two-symbol differential amplitude detection. Through Monte-Carlo simulations, we empirically validate the performance of the proposed amplitude and phase detectors. The presented numerical results show that the spectral efficiency attained in one-bit differential systems is better than the spectral efficiency attained in one-bit coherent systems

eess.SP↗

arXiv2021

Online Meta-Learning for Scene-Diverse Waveform-Agile Radar Target Tracking

A fundamental problem for waveform-agile radar systems is that the true environment is unknown, and transmission policies which perform well for a particular tracking instance may be sub-optimal for another. Additionally, there is a limited time window for each target track, and the radar must learn an effective strategy from a sequence of measurements in a timely manner. This paper studies a Bayesian meta-learning model for radar waveform selection which seeks to learn an inductive bias to quickly optimize tracking performance across a class of radar scenes. We cast the waveform selection problem in the framework of sequential Bayesian inference, and introduce a contextual bandit variant of the recently proposed meta-Thompson Sampling algorithm, which learns an inductive bias in the form of a prior distribution. Each track is treated as an instance of a contextual bandit learning problem, coming from a task distribution. We show that the meta-learning process results in an appreciably faster learning, resulting in significantly fewer lost tracks than a conventional learning approach equipped with an uninformative prior.

cs.IT↗

arXiv2021

Multi-Target Localization Using Polarization Sensitive Arrays

In this work we develop clustering techniques for the Bearing Only Target Localization (BOTL) problem. Our scenario has a receiver move along some path, generating bearing estimates on some interval. Multiple emitting targets exist in the environment, and may be physically close with respect to the receiver distance. The first method is iterative and uses only a series of observed bearings to multiple targets to establish clusters. In each iteration, target positions are estimated using a nonlinear least squares solution. The second technique uses additional polarization information, and is shown to be more effective while requiring more information. In addition the second technique is non-iterative and requires far less computation. In this work we presume knowledge of the number of targets. We conclude by providing simulations of our method and show that the proposed approach outperforms previously proposed methods.

eess.SP↗

arXiv2021

Open-set Classification of Common Waveforms Using A Deep Feed-forward Network and Binary Isolation Forest Models

In this paper, we examine the use of a deep multi-layer perceptron architecture to classify received signals as one of seven common waveforms, single carrier (SC), single-carrier frequency division multiple access (SC-FDMA), orthogonal frequency division multiplexing (OFDM), linear frequency modulation (LFM), amplitude modulation (AM), frequency modulation (FM), and phase-coded pulse modulation used in communication and radar networks. Synchronization of the signals is not needed as we assume there is an unknown and uncompensated time and frequency offset. The classifier is open-set meaning it assumes unknown waveforms may appear. Isolation forest (IF) models acting as binary classifiers are used for each known signal class to perform detection of possible unknown signals. This is accomplished using the 32-length feature vector from a dense layer as input to the IF models. The classifier and IF models work together to monitor the spectrum and identify waveforms along with detecting unknown waveforms. Results showed the classifier had 100% classification rate above 0 dB with an accuracy of 83.2% and 94.7% at -10 dB and -5 dB, respectively, with signal impairments present. Results for the IF models showed an overall accuracy of 98% when detecting known and unknown signals with signal impairments present. IF models were able to reject all unknown signals while signals similar to known signals were able to pass through 2% of the time due to the contamination rate used during training. Overall, the entire system can classify correctly in an open-set mode with 98% accuracy at SNR greater than 0 dB.

cs.LG↗

arXiv2021

Classification of Common Waveforms Including a Watchdog for Unknown Signals

In this paper, we examine the use of a deep multi-layer perceptron model architecture to classify received signal samples as coming from one of four common waveforms, Single Carrier (SC), Single-Carrier Frequency Division Multiple Access (SC-FDMA), Orthogonal Frequency Division Multiplexing (OFDM), and Linear Frequency Modulation (LFM), used in communication and radar networks. Synchronization of the signals is not needed as we assume there is an unknown and uncompensated time and frequency offset. An autoencoder with a deep CNN architecture is also examined to create a new fifth classification category of an unknown waveform type. This is accomplished by calculating a minimum and maximum threshold values from the root mean square error (RMSE) of the radar and communication waveforms. The classifier and autoencoder work together to monitor a spectrum area to identify the common waveforms inside the area of operation along with detecting unknown waveforms. Results from testing showed the classifier had 100\% classification rate above 0 dB with accuracy of 83.2\% and 94.7\% at -10 dB and -5 dB, respectively, with signal impairments present. Results for the anomaly detector showed 85.3\% accuracy at 0 dB with 100\% at SNR greater than 0 dB with signal impairments present when using a high-value Fast Fourier Transform (FFT) size. Accurate detection rates decline as additional noise is introduced to the signals, with 78.1\% at -5 dB and 56.5\% at -10 dB. However, these low rates seen can be potentially mitigated by using even higher FFT sizes also shown in our results.

eess.SP↗

arXiv2021

Open Set Wireless Standard Classification Using Convolutional Neural Networks

In congested electromagnetic environments, cognitive radios require knowledge about other emitters in order to optimize their dynamic spectrum access strategy. Deep learning classification algorithms have been used to recognize the wireless signal standards of emitters with high accuracy, but are limited to classifying signal classes that appear in their training set. This diminishes the performance of deep learning classifiers deployed in the field because they cannot accurately identify signals from classes outside of the training set. In this paper, a convolution neural network based open set classifier is proposed with the ability to detect if signals are not from known classes by thresholding the output sigmoid activation. The open set classifier was trained on 4G LTE, 5G NR, IEEE 802.11ax, Bluetooth Low Energy 5.0, and Narrowband Internet-of-Things signals impaired with Rayleigh or Rician fading, AWGN, frequency offsets, and in-phase/quadrature imbalances. Then, the classifier was tested on OFDM, SC-FDMA, SC, AM, and FM signals, which did not appear in the training set classes. The closed set classifier achieves an average accuracy of 94.5% for known signals with SNR's greater than 0 dB, but by design, has a 0% accuracy detecting signals from unknown classes. On the other hand, the open set classifier retains an 86% accuracy for known signal classes, but can detect 95.5% of signals from unknown classes with SNR's greater than 0 dB.

eess.SP↗

arXiv2021

Waveform Selection for Radar Tracking in Target Channels With Memory via Universal Learning

In tracking radar, the sensing environment often varies significantly over a track duration due to the target's trajectory and dynamic interference. Adapting the radar's waveform using partial information about the state of the scene has been shown to provide performance benefits in many practical scenarios. Moreover, radar measurements generally exhibit strong temporal correlation, allowing memory-based learning algorithms to effectively learn waveform selection strategies. This work examines a radar system which builds a compressed model of the radar-environment interface in the form of a context-tree. The radar uses this context tree-based model to select waveforms in a signal-dependent target channel, which may respond adversarially to the radar's strategy. This approach is guaranteed to asymptotically converge to the average-cost optimal policy for any stationary target channel that can be represented as a Markov process of order U < $\infty$, where the constant U is unknown to the radar. The proposed approach is tested in a simulation study, and is shown to provide tracking performance improvements over two state-of-the-art waveform selection schemes.

cs.IT↗

arXiv2021

Constrained Contextual Bandit Learning for Adaptive Radar Waveform Selection

A sequential decision process in which an adaptive radar system repeatedly interacts with a finite-state target channel is studied. The radar is capable of passively sensing the spectrum at regular intervals, which provides side information for the waveform selection process. The radar transmitter uses the sequence of spectrum observations as well as feedback from a collocated receiver to select waveforms which accurately estimate target parameters. It is shown that the waveform selection problem can be effectively addressed using a linear contextual bandit formulation in a manner that is both computationally feasible and sample efficient. Stochastic and adversarial linear contextual bandit models are introduced, allowing the radar to achieve effective performance in broad classes of physical environments. Simulations in a radar-communication coexistence scenario, as well as in an adversarial radar-jammer scenario, demonstrate that the proposed formulation provides a substantial improvement in target detection performance when Thompson Sampling and EXP3 algorithms are used to drive the waveform selection process. Further, it is shown that the harmful impacts of pulse-agile behavior on coherently processed radar data can be mitigated by adopting a time-varying constraint on the radar's waveform catalog.

cs.IT↗

arXiv2021

Constrained Online Learning to Mitigate Distortion Effects in Pulse-Agile Cognitive Radar

Pulse-agile radar systems have demonstrated favorable performance in dynamic electromagnetic scenarios. However, the use of non-identical waveforms within a radar's coherent processing interval may lead to harmful distortion effects when pulse-Doppler processing is used. This paper presents an online learning framework to optimize detection performance while mitigating harmful sidelobe levels. The radar waveform selection process is formulated as a linear contextual bandit problem, within which waveform adaptations which exceed a tolerable level of expected distortion are eliminated. The constrained online learning approach is effective and computationally feasible, evidenced by simulations in a radar-communication coexistence scenario and in the presence of intentional adaptive jamming. This approach is applied to both stochastic and adversarial contextual bandit learning models and the detection performance in dynamic scenarios is evaluated.

cs.IT↗

arXiv2021

Multi-player Bandits for Distributed Cognitive Radar

With new applications for radar networks such as automotive control or indoor localization, the need for spectrum sharing and general interoperability is expected to rise. This paper describes the application of multi-player bandit algorithms for waveform selection to a distributed cognitive radar network that must coexist with a communications system. Specifically, we make the assumption that radar nodes in the network have no dedicated communication channel. As we will discuss later, nodes can communicate indirectly by taking actions which intentionally interfere with other nodes and observing the resulting collisions. The radar nodes attempt to optimize their own spectrum utilization while avoiding collisions, not only with each other, but with the communications system. The communications system is assumed to statically occupy some subset of the bands available to the radar network. First, we examine models that assume each node experiences equivalent channel conditions, and later examine a model that relaxes this assumption.

cs.IT↗

arXiv2020

Characterizing the First-Arriving Multipath Component in 5G Millimeter Wave Networks: TOA, AOA, and Non-Line-of-Sight Bias

This paper presents a stochastic geometry-based analysis of propagation statistics for 5G millimeter wave (mm-wave) cellular. In particular, the time-of-arrival (TOA) and angle-of-arrival (AOA) distributions of the first-arriving multipath component (MPC) are derived. These statistics find their utility in many applications such as cellular-based localization, channel modeling, and link establishment for mm-wave initial access (IA). Leveraging tools from stochastic geometry, a Boolean model is used to statistically characterize the random locations, orientations, and sizes of reflectors, e.g., buildings. Assuming non-line-of-sight (NLOS) propagation is due to first-order (i.e., single-bounce) reflections, and that reflectors can either facilitate or block reflections, the distribution of the path length (i.e., absolute time delay) of the first-arriving MPC is derived. This result is then used to obtain the first NLOS bias distribution in the localization literature that is based on the absolute delay of the first-arriving MPC for outdoor time-of-flight (TOF) range measurements. This distribution is shown to match exceptionally well with commonly assumed gamma and exponential NLOS bias models in the literature, which were only attainted previously through heuristic or indirect methods. Continuing under this analytical framework, the AOA distribution of the first-arriving MPC is derived, which gives novel insight into how environmental obstacles affect the AOA and also represents the first AOA distribution derived under the Boolean Model.

cs.IT↗

arXiv2020

When is Enough Enough? "Just Enough" Decision Making with Recurrent Neural Networks for Radio Frequency Machine Learning

Prior work has demonstrated that recurrent neural network architectures show promising improvements over other machine learning architectures when processing temporally correlated inputs, such as wireless communication signals. Additionally, recurrent neural networks typically process data on a sequential basis, enabling the potential for near real-time results. In this work, we investigate the novel usage of "just enough" decision making metrics for making decisions during inference based on a variable number of input symbols. Since some signals are more complex than others, due to channel conditions, transmitter/receiver effects, etc., being able to dynamically utilize just enough of the received symbols to make a reliable decision allows for more efficient decision making in applications such as electronic warfare and dynamic spectrum sharing. To demonstrate the validity of this concept, four approaches to making "just enough" decisions are considered in this work and each are analyzed for their applicability to wireless communication machine learning applications.

eess.SP↗

arXiv2020

The RFML Ecosystem: A Look at the Unique Challenges of Applying Deep Learning to Radio Frequency Applications

While deep machine learning technologies are now pervasive in state-of-the-art image recognition and natural language processing applications, only in recent years have these technologies started to sufficiently mature in applications related to wireless communications. In particular, recent research has shown deep machine learning to be an enabling technology for cognitive radio applications as well as a useful tool for supplementing expertly defined algorithms for spectrum sensing applications such as signal detection, estimation, and classification (termed here as Radio Frequency Machine Learning, or RFML). A major driver for the usage of deep machine learning in the context of wireless communications is that little, to no, a priori knowledge of the intended spectral environment is required, given that there is an abundance of representative data to facilitate training and evaluation. However, in addition to this fundamental need for sufficient data, there are other key considerations, such as trust, security, and hardware/software issues, that must be taken into account before deploying deep machine learning systems in real-world wireless communication applications. This paper provides an overview and survey of prior work related to these major research considerations. In particular, we present their unique considerations in the RFML application space, which are not generally present in the image, audio, and/or text application spaces.

eess.SP↗

arXiv2020

Deep Reinforcement Learning Control for Radar Detection and Tracking in Congested Spectral Environments

In this paper, dynamic non-cooperative coexistence between a cognitive pulsed radar and a nearby communications system is addressed by applying nonlinear value function approximation via deep reinforcement learning (Deep RL) to develop a policy for optimal radar performance. The radar learns to vary the bandwidth and center frequency of its linear frequency modulated (LFM) waveforms to mitigate mutual interference with other systems and improve target detection performance while also maintaining sufficient utilization of the available frequency bands required for a fine range resolution. We demonstrate that our approach, based on the Deep Q-Learning (DQL) algorithm, enhances important radar metrics, including SINR and bandwidth utilization, more effectively than policy iteration or sense-and-avoid (SAA) approaches in a variety of realistic coexistence environments. We also extend the DQL-based approach to incorporate Double Q-learning and a recurrent neural network to form a Double Deep Recurrent Q-Network (DDRQN). We demonstrate the DDRQN results in favorable performance and stability compared to DQL and policy iteration. Finally, we demonstrate the practicality of our proposed approach through a discussion of experiments performed on a software defined radar (SDRadar) prototype system. Our experimental results indicate that the proposed Deep RL approach significantly improves radar detection performance in congested spectral environments when compared to policy iteration and SAA.

eess.SP↗