Add to ORKGSIGLETIB: RA 2045 (1982,20) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
This paper introduces the theory and hardware im-plementation of two new algorithms for computing a ...
The methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transfor...
AbstractLet G be a f inite group. Then Ls(G), the linear complexity of a suitable Wedderburn transfo...
AbstractWe show how to compute the multiplicative complexity of the Discrete Fourier Transform on an...
A model has been developed to permit analysis of the expected execution-time performance of Fourier ...
AbstractMost results in multiplicative complexity assume that the functions to be computed are in th...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
AbstractWe obtain the multiplicative complexity of discrete cosine transforms in all cases. It is gi...
SIGLEAvailable from British Library Document Supply Centre-DSC:DX210648 / BLDSC - British Library Do...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
SIGLETIB: RO 5219 (66) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
We use the Battle.Lemarié scaling function in an algorithm for fast computation of the Fourier trans...
We present an algorithm for the evaluation of the Fourier transform of piecewise constant functions ...
ISBN: 0818669853Computing a Fourier transform with a parallel architecture of serial operators needs...
This paper introduces the theory and hardware im-plementation of two new algorithms for computing a ...
The methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transfor...
AbstractLet G be a f inite group. Then Ls(G), the linear complexity of a suitable Wedderburn transfo...
AbstractWe show how to compute the multiplicative complexity of the Discrete Fourier Transform on an...
A model has been developed to permit analysis of the expected execution-time performance of Fourier ...
AbstractMost results in multiplicative complexity assume that the functions to be computed are in th...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
AbstractWe obtain the multiplicative complexity of discrete cosine transforms in all cases. It is gi...
SIGLEAvailable from British Library Document Supply Centre-DSC:DX210648 / BLDSC - British Library Do...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
SIGLETIB: RO 5219 (66) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
We use the Battle.Lemarié scaling function in an algorithm for fast computation of the Fourier trans...
We present an algorithm for the evaluation of the Fourier transform of piecewise constant functions ...
ISBN: 0818669853Computing a Fourier transform with a parallel architecture of serial operators needs...
This paper introduces the theory and hardware im-plementation of two new algorithms for computing a ...
The methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transfor...
AbstractLet G be a f inite group. Then Ls(G), the linear complexity of a suitable Wedderburn transfo...