Paper presents general methods of processing one- and two-dimensional signals that are based on functional transform of signal using corresponding transformation functions, for example, as in DFT, Hilbert transform, wavelet transform, etc. Fast parallel algorithms for such functional transforms in complete (PCM-PCM) and mixed (ÑPCM-PCM or DM-PCM) formats are suggested. The latter ones are obtained using the proven theorems. In real-time mode and assuming the use of the same element base the suggested algorithms provide wider bandwidth of processed signals compared to those based on FFT. Their ability to provide results faster increases even more when substituting multiplication for shift operations. Examples of using the developed methods i...
Spatial transforms play a central role in image and signal processing applications. The Walsh-Hadama...
Copyright © 2015 Pablo Soto-Quiros. This is an open access article distributed under the Creative Co...
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inv...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
The performance of the parallel vector implementation of the one- and two-dimensional orthogonal tra...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
Abstract. The paper deals with various parallel platforms used for high performance computing in the...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
The methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transfor...
Mixed transform coders have been shown to consistently yield higher signal quality than those based ...
https://www.scopus.com/inward/record.url?eid=2-s2.0-84942786573&partnerID=40&md5=6cf403e00ea70a97e83...
Mixed transform techniques represent signals using combinations of basis functions, chosen from two ...
This paper presents a mathematical framework for a family of discrete-time discrete-frequency transf...
Spatial transforms play a central role in image and signal processing applications. The Walsh-Hadama...
Copyright © 2015 Pablo Soto-Quiros. This is an open access article distributed under the Creative Co...
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inv...
This thesis deals with a new approaches to the fast computation of discrete Fourier-like signal tran...
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequenc...
The performance of the parallel vector implementation of the one- and two-dimensional orthogonal tra...
AbstractThe development of the fast Fourier transform (FFT) and its numerous variants in the past 30...
Abstract. The paper deals with various parallel platforms used for high performance computing in the...
We present a MPI based software library for computing the fast Fourier transforms on massively paral...
Abstract. We present an MPI based software library for computing fast Fourier transforms (FFTs) on m...
The methods of fast parallel calculation of multidimen-sional hypercomplex discrete Fourier transfor...
Mixed transform coders have been shown to consistently yield higher signal quality than those based ...
https://www.scopus.com/inward/record.url?eid=2-s2.0-84942786573&partnerID=40&md5=6cf403e00ea70a97e83...
Mixed transform techniques represent signals using combinations of basis functions, chosen from two ...
This paper presents a mathematical framework for a family of discrete-time discrete-frequency transf...
Spatial transforms play a central role in image and signal processing applications. The Walsh-Hadama...
Copyright © 2015 Pablo Soto-Quiros. This is an open access article distributed under the Creative Co...
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inv...