Performance assessment of time–frequency RFI mitigation techniques in microwave radiometry

©2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Radio–frequency interference (RFI) signals are a well-known threat for microwave radiometry (MWR) applications. In order to alleviate this problem, different approaches for RFI detection and mitigation are currently under development. Since RFI signals are man made, they tend to have their power more concentrated in the time–frequency (TF) space as compared to naturally emitted noise. The aim of this paper is to perform an assessment of different TF RFI mitigation techniques in terms of probability of detection, resolution loss (RL), and mitigation performance. In this assessment, six different kinds of RFI signals have been considered: a glitch, a burst of pulses, a wide-band chirp, a narrow-band chirp, a continuous wave, and a wide-band modulation. The results show that the best performance occurs when the transform basis has a similar shape as compared to the RFI signal. For the best case performance, the maximum residual RFI temperature is 14.8 K, and the worst RL is 8.4%. Moreover, the multiresolution Fourier transform technique appears as a good tradeoff solution among all other techniques since it can mitigate all RFI signals under evaluation with a maximum residual RFI temperature of 21 K, and a worst RL of 26.3%. Although the obtained results are still far from an acceptable bias Misplaced < 1 K for MWR applications, there is still work to do in a combined test using the information gathered simultaneously by all mitigation techniques, which could improve the overall performance of RFI mitigation.Peer ReviewedPostprint (author's final draft

Likelihood-ratio ranking of gravitational-wave candidates in a non-Gaussian background

We describe a general approach to detection of transient gravitational-wave signals in the presence of non-Gaussian background noise. We prove that under quite general conditions, the ratio of the likelihood of observed data to contain a signal to the likelihood of it being a noise fluctuation provides optimal ranking for the candidate events found in an experiment. The likelihood-ratio ranking allows us to combine different kinds of data into a single analysis. We apply the general framework to the problem of unifying the results of independent experiments and the problem of accounting for non-Gaussian artifacts in the searches for gravitational waves from compact binary coalescence in LIGO data. We show analytically and confirm through simulations that in both cases the likelihood ratio statistic results in an improved analysis.Comment: 10 pages, 6 figure

Best chirplet chain: near-optimal detection of gravitational wave chirps

The list of putative sources of gravitational waves possibly detected by the ongoing worldwide network of large scale interferometers has been continuously growing in the last years. For some of them, the detection is made difficult by the lack of a complete information about the expected signal. We concentrate on the case where the expected GW is a quasi-periodic frequency modulated signal i.e., a chirp. In this article, we address the question of detecting an a priori unknown GW chirp. We introduce a general chirp model and claim that it includes all physically realistic GW chirps. We produce a finite grid of template waveforms which samples the resulting set of possible chirps. If we follow the classical approach (used for the detection of inspiralling binary chirps, for instance), we would build a bank of quadrature matched filters comparing the data to each of the templates of this grid. The detection would then be achieved by thresholding the output, the maximum giving the individual which best fits the data. In the present case, this exhaustive search is not tractable because of the very large number of templates in the grid. We show that the exhaustive search can be reformulated (using approximations) as a pattern search in the time-frequency plane. This motivates an approximate but feasible alternative solution which is clearly linked to the optimal one. [abridged version of the abstract]Comment: 23 pages, 9 figures. Accepted for publication in Phys. Rev D Some typos corrected and changes made according to referee's comment

Classification of chirp signals using hierarchical bayesian learning and MCMC methods

This paper addresses the problem of classifying chirp signals using hierarchical Bayesian learning together with Markov chain Monte Carlo (MCMC) methods. Bayesian learning consists of estimating the distribution of the observed data conditional on each class from a set of training samples. Unfortunately, this estimation requires to evaluate intractable multidimensional integrals. This paper studies an original implementation of hierarchical Bayesian learning that estimates the class conditional probability densities using MCMC methods. The performance of this implementation is first studied via an academic example for which the class conditional densities are known. The problem of classifying chirp signals is then addressed by using a similar hierarchical Bayesian learning implementation based on a Metropolis-within-Gibbs algorithm