### A general approach for orthogonal 4-tap integer multiwavelet transforms.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

In this work the problem of characterization of the Discrete Fourier Transform (DFT) spectrum of an original complex-valued signal ${o}_{t}$, t=0,1,...,n-1, modulated by random fluctuations of its amplitude and/or phase is investigated. It is assumed that the amplitude and/or phase of the signal at discrete times of observation are distorted by realizations of uncorrelated random variables or randomly permuted sequences of complex numbers. We derive the expected values and bounds on the variances of such...

We introduce ternary wavelets, based on an interpolating 4-point C^2 ternary stationary subdivision scheme, for compressing fractal-like signals. These wavelets are tightly squeezed and therefore they are more suitable for compressing fractal-like signals. The error in compressing fractal-like signals by ternary wavelets is at most half of that given by four-point wavelets (Wei and Chen, 2002). However, for compressing regular signals we further classify ternary wavelets into 'odd ternary' and 'even...

We give a short account of some time-frequency methods which are relevant in the context of gravity waves detection. We focus on the case of wavelet analysis which we believe is particularly appropriate. We show how wavelet transforms can lead to efficient algorithms for detection and parameter estimation of binary coalescence signals. In addition, we give in an appendix some of the ingredients needed for the construction of discrete wavelet decompositions and corresponding fast algorithms.