1,080 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
New sampling theorem and multiplicative filtering in the FRFT domain
Having in consideration a fractional convolution associated with the fractional Fourier transform (FRFT), we propose a novel reconstruction formula for bandlimited signals in the FRFT domain without using the classical Shannon theorem. This may be considered the main contribution of this work, and numerical experiments are implemented to demonstrate the effectiveness of the proposed sampling theorem. As a second goal, we also look for the designing of multiplicative filters. Indeed, we also convert the multiplicative filtering in FRFT domain to the time domain, which can be realized by Fast Fourier transform. Two concrete examples are included where the use of the present results is illustrated.publishe
Asymptotic optimal SINR performance bound for space-time beamforming
International audienceIn many detection applications, the main performance criterion is the signal to interference plus noise ratio (SINR). After linear filtering, the optimal SINR corresponds to the maximum value of a Rayleigh quotient, which can be interpreted as the largest generalized eigenvalue of two covariance matrices. Using an extension of Szegö's theorem for the generalized eigenvalues of Hermitian block Toeplitz matrices, an expression of the theoretical asymptotic optimal SINR w.r.t. the number of taps is derived for arbitrary arrays with a limited but arbitrary number of sensors and arbitrary spectra. This bound is interpreted as an optimal zero-bandwidth spatial SINR in some sense. Finally, the speed of convergence of the optimal wideband SINR for a limited number of taps is analyzed for several interference scenario
- âŠ