Subtraction-noise projection in gravitational-wave detector networks

In this paper, we present a successful implementation of a subtraction-noise projection method into a simple, simulated data analysis pipeline of a gravitational-wave search. We investigate the problem to reveal a weak stochastic background signal which is covered by a strong foreground of compact-binary coalescences. The foreground which is estimated by matched filters, has to be subtracted from the data. Even an optimal analysis of foreground signals will leave subtraction noise due to estimation errors of template parameters which may corrupt the measurement of the background signal. The subtraction noise can be removed by a noise projection. We apply our analysis pipeline to the proposed future-generation space-borne Big Bang Observer (BBO) mission which seeks for a stochastic background of primordial GWs in the frequency range $\sim 0.1-1$Hz covered by a foreground of black-hole and neutron-star binaries. Our analysis is based on a simulation code which provides a dynamical model of a time-delay interferometer (TDI) network. It generates the data as time series and incorporates the analysis pipeline together with the noise projection. Our results confirm previous ad hoc predictions which say that BBO will be sensitive to backgrounds with fractional energy densities below $\Omega=10^{-16}$Comment: 54 pages, 15 figure

Extension of Wirtinger's Calculus to Reproducing Kernel Hilbert Spaces and the Complex Kernel LMS

Over the last decade, kernel methods for nonlinear processing have successfully been used in the machine learning community. The primary mathematical tool employed in these methods is the notion of the Reproducing Kernel Hilbert Space. However, so far, the emphasis has been on batch techniques. It is only recently, that online techniques have been considered in the context of adaptive signal processing tasks. Moreover, these efforts have only been focussed on real valued data sequences. To the best of our knowledge, no adaptive kernel-based strategy has been developed, so far, for complex valued signals. Furthermore, although the real reproducing kernels are used in an increasing number of machine learning problems, complex kernels have not, yet, been used, in spite of their potential interest in applications that deal with complex signals, with Communications being a typical example. In this paper, we present a general framework to attack the problem of adaptive filtering of complex signals, using either real reproducing kernels, taking advantage of a technique called \textit{complexification} of real RKHSs, or complex reproducing kernels, highlighting the use of the complex gaussian kernel. In order to derive gradients of operators that need to be defined on the associated complex RKHSs, we employ the powerful tool of Wirtinger's Calculus, which has recently attracted attention in the signal processing community. To this end, in this paper, the notion of Wirtinger's calculus is extended, for the first time, to include complex RKHSs and use it to derive several realizations of the Complex Kernel Least-Mean-Square (CKLMS) algorithm. Experiments verify that the CKLMS offers significant performance improvements over several linear and nonlinear algorithms, when dealing with nonlinearities.Comment: 15 pages (double column), preprint of article accepted in IEEE Trans. Sig. Pro

Intermodulation distortion from receiver non-linear phase characteristics Final report

Computation of intermodulation distortion levels produced by telemetry system predetection filte