2-D and 1-D multipaired transforms: frequency-time type wavelets

A concept of multipaired unitary transforms is introduced. These kinds of transforms reveal the mathematical structure of Fourier transforms and can be considered intermediate unitary transforms when transferring processed data from the original real space of signals to the complex or frequency space of their images. Considering paired transforms, we analyze simultaneously the splitting of the multidimensional Fourier transform as well as the presentation of the processed multidimensional signal in the form of the short one-dimensional (1-D) "signals", that determine such splitting. The main properties of the orthogonal system of paired functions are described, and the matrix decompositions of the Fourier and Hadamard transforms via the paired transforms are given. The multiplicative complexity of the two-dimensional (2-D) 2/sup r//spl times/2/sup r/-point discrete Fourier transform by the paired transforms is 4/sup r//2(r-7/3)+8/3-12 (r>3), which shows the maximum splitting of the 5-D Fourier transform into the number of the short 1-D Fourier transforms. The 2-D paired transforms are not separable and represent themselves as frequency-time type wavelets for which two parameters are united: frequency and time. The decomposition of the signal is performed in a way that is different from the traditional Haar system of functions.

[1]  Sos S. Agaian,et al.  Split manageable efficient algorithm for Fourier and Hadamard transforms , 2000, IEEE Trans. Signal Process..

[2]  Hong Ren Wu,et al.  On the two-dimensional vector split-radix FFT algorithm , 1989, IEEE Trans. Acoust. Speech Signal Process..

[3]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[4]  C. Burrus,et al.  DFT/FFT and Convolution Algorithms: Theory and Implementation , 1991 .

[5]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[6]  L. Prasad,et al.  WAVELET ANALYSIS with Applications to IMAGE PROCESSING , 1997 .

[7]  Soo-Chang Pei,et al.  Split vector radix 2D fast Fourier transform , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Hong Ren Wu,et al.  The structure of vector radix fast Fourier transforms , 1989, IEEE Trans. Acoust. Speech Signal Process..

[9]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[10]  Andreas Rieder,et al.  Wavelets: Theory and Applications , 1997 .

[11]  C. Rader,et al.  A new principle for fast Fourier transformation , 1976 .

[12]  J. McClellan,et al.  Vector radix fast Fourier transform , 1977 .

[13]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[14]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[15]  Alfred Mertins,et al.  Signal Analysis: Wavelets, Filter Banks, Time-Frequency Transforms and Applications , 1999 .

[16]  C. Sidney Burrus,et al.  On the number of multiplications necessary to compute a length-2nDFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[17]  Shing-Chow Chan,et al.  Split vector-radix fast Fourier transform , 1992, IEEE Trans. Signal Process..

[18]  S. Agaian Hadamard Matrices and Their Applications , 1985 .

[19]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[20]  Truong Q. Nguyen,et al.  Wavelets and filter banks , 1996 .