Add to ORKGThe methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transform (HDFT) are discussed. The theoretical and experimental estima-tion of parallelization efficiency is given. It is shown that proposed method has very high efficiency (up to 90%)
Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals,...
An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of t...
Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It...
The performance of the parallel vector implementation of the one- and two-dimensional orthogonal tra...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
Paper presents general methods of processing one- and two-dimensional signals that are based on func...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inv...
The Fast Fourier Transform appears frequently in scientific computing. Therefore it is desirable to...
https://www.scopus.com/inward/record.url?eid=2-s2.0-84942786573&partnerID=40&md5=6cf403e00ea70a97e83...
Copyright © 2015 Pablo Soto-Quiros. This is an open access article distributed under the Creative Co...
For the greater part of the last 30 years of computing history, computational processing has been pr...
Discrete transformations are widely used in the fields of signal and image processing. Applications...
Abstract. The paper deals with various parallel platforms used for high performance computing in the...
Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals,...
An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of t...
Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It...
The performance of the parallel vector implementation of the one- and two-dimensional orthogonal tra...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
Paper presents general methods of processing one- and two-dimensional signals that are based on func...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inv...
The Fast Fourier Transform appears frequently in scientific computing. Therefore it is desirable to...
https://www.scopus.com/inward/record.url?eid=2-s2.0-84942786573&partnerID=40&md5=6cf403e00ea70a97e83...
Copyright © 2015 Pablo Soto-Quiros. This is an open access article distributed under the Creative Co...
For the greater part of the last 30 years of computing history, computational processing has been pr...
Discrete transformations are widely used in the fields of signal and image processing. Applications...
Abstract. The paper deals with various parallel platforms used for high performance computing in the...
Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals,...
An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of t...
Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It...