We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...

in this paper, using a generalized dunkl translation operator, we obtain an analog of titchmarsh's theorem for the dunkl transform for functions satisfying the lipschitz-dunkl condition in $mathrm{l}_{2,alpha}=mathrm{l}_{alpha}^{2}(mathbb{r})=mathrm{l}^{2}(mathbb{r}, |x|^{2alpha+1}dx), alpha>frac{-1}{2}$.

abstract background: a computer aided diagnosis system was established using the wavelet transform and neural network to differentiate malignant from benign in a   group of patients with histo-pathologically proved breast lesions based on the data derived independ­ently from time-intensity profile.   materials and methods: the per­formance of the artificial neural network (ann) was evaluated us...

the aim of this paper is to prove new quantitative uncertainty principle for the generalized fourier transform connected with a dunkl type operator on the real line. more precisely we prove an lp-lq-version of morgan's theorem.

Although Elzaki transform is stronger than Sumudu and Laplace transforms to solve the ordinary differential equations withnon-constant coefficients, but this method does not lead to finding the answer of some differential equations. In this paper, a method is introduced to find that a differential equation by Elzaki transform can be ‎solved?‎