11,657 research outputs found
Construction of Hilbert Transform Pairs of Wavelet Bases and Gabor-like Transforms
We propose a novel method for constructing Hilbert transform (HT) pairs of
wavelet bases based on a fundamental approximation-theoretic characterization
of scaling functions--the B-spline factorization theorem. In particular,
starting from well-localized scaling functions, we construct HT pairs of
biorthogonal wavelet bases of L^2(R) by relating the corresponding wavelet
filters via a discrete form of the continuous HT filter. As a concrete
application of this methodology, we identify HT pairs of spline wavelets of a
specific flavor, which are then combined to realize a family of complex
wavelets that resemble the optimally-localized Gabor function for sufficiently
large orders.
Analytic wavelets, derived from the complexification of HT wavelet pairs,
exhibit a one-sided spectrum. Based on the tensor-product of such analytic
wavelets, and, in effect, by appropriately combining four separable
biorthogonal wavelet bases of L^2(R^2), we then discuss a methodology for
constructing 2D directional-selective complex wavelets. In particular,
analogous to the HT correspondence between the components of the 1D
counterpart, we relate the real and imaginary components of these complex
wavelets using a multi-dimensional extension of the HT--the directional HT.
Next, we construct a family of complex spline wavelets that resemble the
directional Gabor functions proposed by Daugman. Finally, we present an
efficient FFT-based filterbank algorithm for implementing the associated
complex wavelet transform.Comment: 36 pages, 8 figure
Time-frequency represetation of radar signals using Doppler-Lag block searching Wigner-Ville distribution
Radar signals are time-varying signals where the signal parameters change over time. For these signals, Quadratic Time-Frequency Distribution (QTFD) offers advantages over classical spectrum estimation in terms of frequency and time resolution but it suffers heavily from cross-terms. In generating accurate Time-Frequency Representation (TFR), a kernel function must be able to suppress cross-terms while maintaining auto-terms energy especially in a non-cooperative environment where the parameters of the actual signal are unknown. Thus, a new signal-dependent QTFD is proposed that adaptively estimates the kernel parameters for a wide class of radar signals. The adaptive procedure, Doppler-Lag Block Searching (DLBS) kernel estimation was developed to serve this purpose. Accurate TFRs produced for all simulated radar signals with Instantaneous Frequency (IF) estimation performance are verified using Monte Carlo simulation meeting the requirements of the Cramer-Rao Lower Bound (CRLB) at SNR > 6 dB
Sampling and Super-resolution of Sparse Signals Beyond the Fourier Domain
Recovering a sparse signal from its low-pass projections in the Fourier
domain is a problem of broad interest in science and engineering and is
commonly referred to as super-resolution. In many cases, however, Fourier
domain may not be the natural choice. For example, in holography, low-pass
projections of sparse signals are obtained in the Fresnel domain. Similarly,
time-varying system identification relies on low-pass projections on the space
of linear frequency modulated signals. In this paper, we study the recovery of
sparse signals from low-pass projections in the Special Affine Fourier
Transform domain (SAFT). The SAFT parametrically generalizes a number of well
known unitary transformations that are used in signal processing and optics. In
analogy to the Shannon's sampling framework, we specify sampling theorems for
recovery of sparse signals considering three specific cases: (1) sampling with
arbitrary, bandlimited kernels, (2) sampling with smooth, time-limited kernels
and, (3) recovery from Gabor transform measurements linked with the SAFT
domain. Our work offers a unifying perspective on the sparse sampling problem
which is compatible with the Fourier, Fresnel and Fractional Fourier domain
based results. In deriving our results, we introduce the SAFT series (analogous
to the Fourier series) and the short time SAFT, and study convolution theorems
that establish a convolution--multiplication property in the SAFT domain.Comment: 42 pages, 3 figures, manuscript under revie
Detection of variable frequency signals using a fast chirp transform
The detection of signals with varying frequency is important in many areas of
physics and astrophysics. The current work was motivated by a desire to detect
gravitational waves from the binary inspiral of neutron stars and black holes,
a topic of significant interest for the new generation of interferometric
gravitational wave detectors such as LIGO. However, this work has significant
generality beyond gravitational wave signal detection.
We define a Fast Chirp Transform (FCT) analogous to the Fast Fourier
Transform (FFT). Use of the FCT provides a simple and powerful formalism for
detection of signals with variable frequency just as Fourier transform
techniques provide a formalism for the detection of signals of constant
frequency. In particular, use of the FCT can alleviate the requirement of
generating complicated families of filter functions typically required in the
conventional matched filtering process. We briefly discuss the application of
the FCT to several signal detection problems of current interest
Measuring the three-dimensional shear from simulation data, with applications to weak gravitational lensing
We have developed a new three-dimensional algorithm, based on the standard
PM method, for computing deflections due to weak gravitational lensing. We
compare the results of this method with those of the two-dimensional planar
approach, and rigorously outline the conditions under which the two approaches
are equivalent. Our new algorithm uses a Fast Fourier Transform convolution
method for speed, and has a variable softening feature to provide a realistic
interpretation of the large-scale structure in a simulation. The output values
of the code are compared with those from the Ewald summation method, which we
describe and develop in detail. With an optimal choice of the high frequency
filtering in the Fourier convolution, the maximum errors, when using only a
single particle, are about 7 per cent, with an rms error less than 2 per cent.
For ensembles of particles, used in typical -body simulations, the rms
errors are typically 0.3 per cent. We describe how the output from the
algorithm can be used to generate distributions of magnification, source
ellipticity, shear and convergence for large-scale structure.Comment: 22 pages, latex, 11 figure
Toward Early-Warning Detection of Gravitational Waves from Compact Binary Coalescence
Rapid detection of compact binary coalescence (CBC) with a network of
advanced gravitational-wave detectors will offer a unique opportunity for
multi-messenger astronomy. Prompt detection alerts for the astronomical
community might make it possible to observe the onset of electromagnetic
emission from (CBC). We demonstrate a computationally practical filtering
strategy that could produce early-warning triggers before gravitational
radiation from the final merger has arrived at the detectors.Comment: 16 pages, 7 figures, published in ApJ. Reformatted preprint with
emulateap
ARKCoS: Artifact-Suppressed Accelerated Radial Kernel Convolution on the Sphere
We describe a hybrid Fourier/direct space convolution algorithm for compact
radial (azimuthally symmetric) kernels on the sphere. For high resolution maps
covering a large fraction of the sky, our implementation takes advantage of the
inexpensive massive parallelism afforded by consumer graphics processing units
(GPUs). Applications involve modeling of instrumental beam shapes in terms of
compact kernels, computation of fine-scale wavelet transformations, and optimal
filtering for the detection of point sources. Our algorithm works for any
pixelization where pixels are grouped into isolatitude rings. Even for kernels
that are not bandwidth limited, ringing features are completely absent on an
ECP grid. We demonstrate that they can be highly suppressed on the popular
HEALPix pixelization, for which we develop a freely available implementation of
the algorithm. As an example application, we show that running on a high-end
consumer graphics card our method speeds up beam convolution for simulations of
a characteristic Planck high frequency instrument channel by two orders of
magnitude compared to the commonly used HEALPix implementation on one CPU core
while maintaining at typical a fractional RMS accuracy of about 1 part in 10^5.Comment: 10 pages, 6 figures. Submitted to Astronomy and Astrophysics.
Replaced to match published version. Code can be downloaded at
https://github.com/elsner/arkco
- …