arXiv subjects

William Moran

Publications and source records attributed to William Moran.

At least 19 recordsLinked to original sources

arXiv2025

Myopic Entropy Scheduling for Ramsey Magnetometry

This paper presents an entropy based adaptive measurement sequence strategy for quantum sensing of magnetic fields. To physically ground our ideas we consider a sensor employing a nitrogen vacancy center in diamond, however our approach is applicable to other quantum sensor arrangements. The sensitivity and accuracy of these sensors typically rely on long sequences of rapidly occurring measurements. We introduce a new technique for designing these measurement sequences aimed at reducing the number of measurements required for a specified accuracy as measured by entropy, by selecting measurement parameters that optimally reduce entropy at each measurement. We compare, via simulation, the efficiency and sensitivity of our new method with several existing measurement sequence design strategies. Our results show quantifiable improvements in sensing performance. We also show analytically that our entropy reduction approach, reduces, under certain simplified conditions, to a well-known and widely used measurement strategy.

quant-ph↗

arXiv2025

State-space algorithm for detecting the nanohertz gravitational wave background

The stochastic gravitational wave background (SGWB) can be observed in the nanohertz band using a pulsar timing array (PTA). Here a computationally efficient state-space framework is developed for analysing SGWB data, in which the stochastic gravitational wave strain at Earth is tracked with a non-linear Kalman filter and separated simultaneously from intrinsic, achromatic pulsar spin wandering. The filter is combined with a nested sampler to estimate the parameters of the model, and to calculate a Bayes factor for selecting between models with and without a SGWB. The procedure extends previous state-space formulations of PTA data analysis applied to individually resolvable binary black hole sources. The performance of the new algorithm is tested on synthetic data from the first International PTA Mock Data Challenge. It is shown that the algorithm distinguishes a SGWB from pure noise for $A_{\rm gw} \geq 3 \times 10^{-14}$, where $A_{\rm gw}$ denotes the standard normalization factor for a power spectral density with power-law exponent $-13/3$. Additional, systematic validation tests are also performed with synthetic data generated independently by adjusting the injected parameters to cover astrophysically plausible ranges. Full posterior distributions are recovered and tested for accuracy. The state-space procedure is memory-light and evaluates the likelihood for a standard-sized PTA dataset in $\lesssim 10^{-1}$ s without optimization on a standard central processing unit.

astro-ph.IM↗

arXiv2024

Adaptive cancellation of mains power interference in continuous gravitational wave searches with a hidden Markov model

Continuous gravitational wave searches with terrestrial, long-baseline interferometers are hampered by long-lived, narrowband features in the power spectral density of the detector noise, known as lines. Candidate GW signals which overlap spectrally with known lines are typically vetoed. Here we demonstrate a line subtraction method based on adaptive noise cancellation, using a recursive least squares algorithm, a common approach in electrical engineering applications such as audio and biomedical signal processing. We validate the line subtraction method by combining it with a hidden Markov model (HMM), a standard continuous wave search tool, to detect an injected continuous wave signal with an unknown and randomly wandering frequency, which overlaps with the mains power line at $60 \, {\rm Hz}$ in the Laser Interferometer Gravitational Wave Observatory (LIGO). The performance of the line subtraction method is tested on an injected continuous wave signal obscured by (a) synthetic noise data with both Gaussian and non-Gaussian components, and (b) real noise data obtained from the LIGO Livingston detector. In both cases, before applying the line subtraction method the HMM does not detect the injected continuous wave signal. After applying the line subtraction method the mains power line is suppressed by 20--40 dB, and the HMM detects the underlying signal, with a time-averaged root-mean-square error in the frequency estimate of $\sim 0.05 $ Hz. The performance of the line subtraction method with respect to the characteristics of the 60 Hz line and the control parameters of the recursive least squares algorithm is quantified in terms of receiver operating characteristic curves.

gr-qc↗

arXiv2024

State-space analysis of a continuous gravitational wave source with a pulsar timing array: inclusion of the pulsar terms

Pulsar timing arrays can detect continuous nanohertz gravitational waves emitted by individual supermassive black hole binaries. The data analysis procedure can be formulated within a time-domain, state-space framework, in which the radio timing observations are related to a temporal sequence of latent states, namely the intrinsic pulsar spin frequency. The achromatic wandering of the pulsar spin frequency is tracked using a Kalman filter concurrently with the pulse frequency modulation induced by a gravitational wave from a single source. The modulation is the sum of terms proportional to the gravitational wave strain at the Earth and at every pulsar in the array. Here we generalize previous state-space formulations of the pulsar timing array problem to include the pulsar terms; that is, we copy the pulsar terms from traditional, non-state-space analyses over to the state-space framework. The performance of the generalized Kalman filter is tested using astrophysically representative software injections in Gaussian measurement noise. It is shown that including the pulsar terms corrects for previously identified biases in the parameter estimates (especially the sky position of the source) which also arise in traditional matched-filter analyses that exclude the pulsar terms. Additionally, including the pulsar terms decreases the minimum detectable strain by $14\%$. Overall, the study verifies that the pulsar terms do not raise any special extra impediments for the state-space framework, beyond those studied in traditional analyses. The inspiral-driven evolution of the wave frequency at the Earth and at the retarded time at every pulsar in the array is also investigated.

astro-ph.HE↗

arXiv2024

Kalman tracking and parameter estimation of continuous gravitational waves with a pulsar timing array

Continuous nanohertz gravitational waves from individual supermassive black hole binaries may be detectable with pulsar timing arrays. A novel search strategy is developed, wherein intrinsic achromatic spin wandering is tracked simultaneously with the modulation induced by a single gravitational wave source in the pulse times of arrival. A two-step inference procedure is applied within a state-space framework, such that the modulation is tracked with a Kalman filter, which then provides a likelihood for nested sampling. The procedure estimates the static parameters in the problem, such as the sky position of the source, without fitting for ensemble-averaged statistics such as the power spectral density of the timing noise, and therefore complements traditional parameter estimation methods. It also returns the Bayes factor relating a model with a single gravitational wave source to one without, complementing traditional detection methods. It is shown via astrophysically representative software injections in Gaussian measurement noise that the procedure distinguishes a gravitational wave from pure noise down to a characteristic wave strain of $h_0 \approx 2 \times 10^{-15}$. Full posterior distributions of model parameters are recovered and tested for accuracy. There is a bias of $\approx 0.3$ rad in the marginalised one-dimensional posterior for the orbital inclination $\iota$, introduced by dropping the so-called `pulsar terms'. Smaller biases $\lesssim 10 \%$ are also observed in other static parameters.

astro-ph.HE↗

arXiv2022

Continuous gravitational waves in the lab: recovering audio signals with a table-top optical microphone

Gravitational-wave observatories around the world are searching for continuous waves: persistent signals from sources such as spinning neutron stars. These searches use sophisticated statistical techniques to look for weak signals in noisy data. In this paper, we demonstrate these techniques using a table-top model gravitational-wave detector: a Michelson interferometer where sound is used as an analog for gravitational waves. Using signal processing techniques from continuous-wave searches, we demonstrate the recovery of tones with constant and wandering frequencies. We also explore the use of the interferometer as a teaching tool for educators in physics and electrical engineering by using it as an "optical microphone" to capture music and speech. A range of filtering techniques used to recover signals from noisy data are detailed in the Supplementary Material. Here, we present highlights of our results using a combined notch plus Wiener filter and the statistical log minimum mean-square error (logMMSE) estimator. Using these techniques, we easily recover recordings of simple chords and drums, but complex music and speech are more challenging. This demonstration can be used by educators in undergraduate laboratories and can be adapted for communicating gravitational-wave and signal-processing topics to non-specialist audiences.

gr-qc↗

arXiv2021

Frequency Permutations for Joint Radar and Communications

This paper presents a new joint radar and communication technique based on the classical stepped frequency radar waveform. The randomization in the waveform, which is achieved by using permutations of the sequence of frequency tones, is utilized for data transmission. A new signaling scheme is proposed in which the mapping between incoming data and waveforms is performed based on an efficient combinatorial transform called the Lehmer code. Considering the optimum maximum likelihood (ML) detection, the union bound and the nearest neighbour approximation on the communication block error probability is derived for communication in an additive white Gaussian noise (AWGN) channel. The results are further extended to incorporate the Rician fading channel model, of which the Rayleigh fading channel model is presented as a special case. Furthermore, an efficient communication receiver implementation is discussed based on the Hungarian algorithm which achieves optimum performance with much less operational complexity when compared to an exhaustive search. From the radar perspective, two key analytical tools, namely, the ambiguity function (AF) and the Fisher information matrix are derived. Furthermore, accurate approximations to the Cramer-Rao lower bounds (CRLBs) on the delay and Doppler estimation errors are derived based on which the range and velocity estimation accuracy of the waveform is analysed. Numerical examples are used to highlight the accuracy of the analysis and to illustrate the performance of the proposed waveform.

cs.IT↗

arXiv2021

Combined Radar and Communications with Phase-Modulated Frequency Permutations

This paper focuses on the combined radar and communications problem and conducts a thorough analytical investigation on the effect of phase and frequency change on the communication and sensing functionality. First, we consider the classical stepped frequency radar waveform and modulate data using M-ary phase shift keying (MPSK). Two important analytical tools in radar waveform design, namely the ambiguity function (AF) and the Fisher information matrix (FIM) are derived, based on which, we make the important conclusion that MPSK modulation has a negligible effect on radar local accuracy. Next, we extend the analysis to incorporate frequency permutations and propose a new signalling scheme in which the mapping between incoming data and waveforms is performed based on an efficient combinatorial transform called the Lehmer code. We also provide an efficient communications receiver based on the Hungarian algorithm. From the communications perspective, we consider the optimal maximum likelihood (ML) detector and derive the union bound and nearest neighbour approximation on the block error probability. From the radar sensing perspective, we discuss the broader structure of the waveform based on the AF derivation and quantify the radar local accuracy based on the FIM. Extensive numerical examples are provided to illustrate the accuracy of our results.

cs.IT↗

arXiv2021

Knowledge engineering mixed-integer linear programming: constraint typology

In this paper, we investigate the constraint typology of mixed-integer linear programming MILP formulations. MILP is a commonly used mathematical programming technique for modelling and solving real-life scheduling, routing, planning, resource allocation, timetabling optimization problems, providing optimized business solutions for industry sectors such as: manufacturing, agriculture, defence, healthcare, medicine, energy, finance, and transportation. Despite the numerous real-life Combinatorial Optimization Problems found and solved, and millions yet to be discovered and formulated, the number of types of constraints, the building blocks of a MILP, is relatively much smaller. In the search of a suitable machine readable knowledge representation for MILPs, we propose an optimization modelling tree built based upon an MILP ontology that can be used as a guidance for automated systems to elicit an MILP model from end-users on their combinatorial business optimization problems.

cs.AI↗

arXiv2020

Coordinating Complementary Waveforms for Suppressing Range Sidelobes in a Doppler Band

We present a general method for constructing radar transmit pulse trains and receive filters for which the radar point-spread function in delay and Doppler (radar cross-ambiguity function) is essentially free of range sidelobes inside a Doppler interval around the zero-Doppler axis. The transmit and receive pulse trains are constructed by coordinating the transmission of a pair of Golay complementary waveforms across time according to zeros and ones in a binary sequence $P$. In the receive pulse train filter, each waveform is weighted according to an element from another sequence $Q$. We show that the spectrum of essentially the product of $P$ and $Q$ sequences controls the size of the range sidelobes of the cross-ambiguity function. We annihilate the range sidelobes at low Doppler by designing the $(P,Q)$ pairs such that their products have high-order spectral nulls around zero Doppler. We specify the subspace, along with a basis, for such sequences, thereby providing a general way of constructing $(P,Q)$ pairs. At the same time, the signal-to-noise ratio (SNR) at the receiver output, for a single point target in white noise, depends only on the choice of $Q$. By jointly designing the transmit-receive sequences $(P,Q)$, we can maximize the output SNR subject to achieving a given order of the spectral null. The proposed $(P,Q)$ constructions can also be extended to sequences consisting of more than two complementary waveforms; this is done explicitly for a library of Golay complementary quads. Finally, we extend the construction of $(P,Q)$ pairs to multiple-input-multiple-output (MIMO) radar, by designing transmit-receive pairs of paraunitary waveform matrices whose matrix-valued cross-ambiguity function is essentially free of range sidelobes inside a Doppler interval around the zero-Doppler axis.

cs.IT↗

arXiv2019

Identifying Cognitive Radars -- Inverse Reinforcement Learning using Revealed Preferences

We consider an inverse reinforcement learning problem involving us versus an enemy radar equipped with a Bayesian tracker. By observing the emissions of the enemy radar,how can we identify if the radar is cognitive (constrained utility maximizer)? Given the observed sequence of actions taken by the enemy's radar, we consider three problems: (i) Are the enemy radar's actions (waveform choice, beam scheduling) consistent with constrained utility maximization? If so how can we estimate the cognitive radar's utility function that is consistent with its actions. We formulate and solve the problem in terms of the spectra (eigenvalues) of the state and observation noise covariance matrices, and the algebraic Riccati equation. (ii) How to construct a statistical test for detecting a cognitive radar (constrained utility maximization) when we observe the radar's actions in noise or the radar observes our probe signal in noise? We propose a statistical detector with a tight Type-II error bound. (iii) How can we optimally probe (interrogate) the enemy's radar by choosing our state to minimize the Type-II error of detecting if the radar is deploying an economic rational strategy, subject to a constraint on the Type-I detection error? We present a stochastic optimization algorithm to optimize our probe signal. The main analysis framework used in this paper is that of revealed preferences from microeconomics.

eess.SP↗

arXiv2015

String Submodular Functions with Curvature Constraints

The problem of objectively choosing a string of actions to optimize an objective function that is string submodular has been considered in [1]. There it is shown that the greedy strategy, consisting of a string of actions that only locally maximizes the step-wise gain in the objective function achieves at least a (1-e^{-1})-approximation to the optimal strategy. This paper improves this approximation by introducing additional constraints on curvatures, namely, total backward curvature, total forward curvature, and elemental forward curvature. We show that if the objective function has total backward curvature σ, then the greedy strategy achieves at least a \frac{1}σ(1-e^{-σ})-approximation of the optimal strategy. If the objective function has total forward curvature ε, then the greedy strategy achieves at least a (1-ε)-approximation of the optimal strategy. Moreover, we consider a generalization of the diminishing-return property by defining the elemental forward curvature. We also consider the problem of maximizing the objective function subject to general a string-matroid constraint. We investigate an applications of string submodular functions with curvature constraints.

cs.DS↗

arXiv2014

Operator-Valued Frames for the Heisenberg Group

A classical result of Duffin and Schaeffer gives conditions under which a discrete collection of characters on $\mathbb{R}$, restricted to $E = (-1/2, 1/2)$, forms a Hilbert-space frame for $L^2(E)$. For the case of characters with period one, this is just the Poisson Summation Formula. Duffin and Schaeffer show that perturbations preserve the frame condition in this case. This paper gives analogous results for the real Heisenberg group $H_n$, where frames are replaced by operator-valued frames. The Selberg Trace Formula is used to show that perturbations of the orthogonal case continue to behave as operator-valued frames. This technique enables the construction of decompositions of elements of $L^2(E)$ for suitable subsets $E$ of $H_n$ in terms of representations of $H_n$.

math.RT↗

arXiv2014

Projective tensor products and Apq spaces

The aim of this paper is to extend the notion of Apq space from its historical context in the work of Herz and to recognise such spaces as preduals of spaces of intertwining operators of induced representations as suggested by the work of Rieffel. This generalisation of Apq spaces involves considering projective tensor products of Lp spaces of Banach space-valued functions (the spaces of induced representations) and constructing a convolution of functions of such spaces. Sufficient conditions for the existence of the integral of the convolution are established. Most of this analysis depends upon an identity we derive of Radon-Nikodym derivatives of measures on homogeneous spaces involved. The elements of the generalised Apq space are shown to be cross-sections of a Banach semi-bundle over the double coset space corresponding to the groups from which the representations are induced, and their properties are duly discussed. In particular, the generalised form of the classical result Lp*Lq is a subset of Lr; where 1/r = 1/p + 1/q - 1; is shown to be true in this situation. The result that the Apq space is the predual of the space of intertwining operators is then established, under the condition that the intertwining operators can be approximated, in the ultraweak operator topology, by integral operators.

math.RT↗

arXiv2013

Hypothesis Testing in Feedforward Networks with Broadcast Failures

Consider a countably infinite set of nodes, which sequentially make decisions between two given hypotheses. Each node takes a measurement of the underlying truth, observes the decisions from some immediate predecessors, and makes a decision between the given hypotheses. We consider two classes of broadcast failures: 1) each node broadcasts a decision to the other nodes, subject to random erasure in the form of a binary erasure channel; 2) each node broadcasts a randomly flipped decision to the other nodes in the form of a binary symmetric channel. We are interested in whether there exists a decision strategy consisting of a sequence of likelihood ratio tests such that the node decisions converge in probability to the underlying truth. In both cases, we show that if each node only learns from a bounded number of immediate predecessors, then there does not exist a decision strategy such that the decisions converge in probability to the underlying truth. However, in case 1, we show that if each node learns from an unboundedly growing number of predecessors, then the decisions converge in probability to the underlying truth, even when the erasure probabilities converge to 1. We also derive the convergence rate of the error probability. In case 2, we show that if each node learns from all of its previous predecessors, then the decisions converge in probability to the underlying truth when the flipping probabilities of the binary symmetric channels are bounded away from 1/2. In the case where the flipping probabilities converge to 1/2, we derive a necessary condition on the convergence rate of the flipping probabilities such that the decisions still converge to the underlying truth. We also explicitly characterize the relationship between the convergence rate of the error probability and the convergence rate of the flipping probabilities.

cs.IT↗

arXiv2012

Learning in Hierarchical Social Networks

We study a social network consisting of agents organized as a hierarchical M-ary rooted tree, common in enterprise and military organizational structures. The goal is to aggregate information to solve a binary hypothesis testing problem. Each agent at a leaf of the tree, and only such an agent, makes a direct measurement of the underlying true hypothesis. The leaf agent then makes a decision and sends it to its supervising agent, at the next level of the tree. Each supervising agent aggregates the decisions from the M members of its group, produces a summary message, and sends it to its supervisor at the next level, and so on. Ultimately, the agent at the root of the tree makes an overall decision. We derive upper and lower bounds for the Type I and II error probabilities associated with this decision with respect to the number of leaf agents, which in turn characterize the converge rates of the Type I, Type II, and total error probabilities. We also provide a message-passing scheme involving non-binary message alphabets and characterize the exponent of the error probability with respect to the message alphabet size.

cs.SI↗

arXiv2012

Detection Performance in Balanced Binary Relay Trees with Node and Link Failures

We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to $N$ identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child nodes into a new message and sends it up toward the fusion center. We derive upper and lower bounds for the total error probability $P_N$ as explicit functions of $N$ in the case where nodes and links fail with certain probabilities. These characterize the asymptotic decay rate of the total error probability as $N$ goes to infinity. Naturally, this decay rate is not larger than that in the non-failure case, which is $\sqrt N$. However, we derive an explicit necessary and sufficient condition on the decay rate of the local failure probabilities $p_k$ (combination of node and link failure probabilities at each level) such that the decay rate of the total error probability in the failure case is the same as that of the non-failure case. More precisely, we show that $\log P_N^{-1}=Θ(\sqrt N)$ if and only if $\log p_k^{-1}=Ω(2^{k/2})$.

cs.IT↗

arXiv2012

Error Probability Bounds for M-ary Relay Trees

We study the detection error probabilities associated with an M-ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are sensors. The root of the tree represents a fusion center that makes the overall detection decision. Each of the other nodes in the tree is a relay node that combines M summarized messages from its immediate child nodes to form a single output message using the majority dominance rule. We derive tight upper and lower bounds for the Type I and II error probabilities at the fusion center as explicit functions of the number of sensors in the case of binary message alphabets. These bounds characterize how fast the error probabilities converge to 0 with respect to the number of sensors.

cs.IT↗