In a recent paper [1], Truong et al. have presented a new method for computing two-dimensional convolutions. It is shown that a modification of their algorithm can lead to a slightly more efficient method, i.e., a gain in efficiency of 5-10 percent can be attained
A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the ...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...
In a recent paper [1], Truong et al. have presented a new method for computing two-dimensional convo...
In a recent paper [1], Truong et al. have presented a new method for computing two-dimensional convo...
Abstract: Discrete transforms are introduced and are defined in a ring of polynomials. These polynom...
[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs...
[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs...
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings42180-...
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D Number T...
We present a very simple and fast algorithm to compute the convolution of an arbitrary sequence x wi...
Click on the DOI link to access the article (may not be free)Conventional two dimensional fast Fouri...
AbstractA classical scheme for multiplying polynomials is given by the Cauchy product formula. Faste...
AbstractIn this paper, we consider the related problems of convolution and polynomial multiplication...
Abstract. A polynomial transform is the multiplication of an input vector x ∈ Cn by a matrix Pb;α ∈ ...
A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the ...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...
In a recent paper [1], Truong et al. have presented a new method for computing two-dimensional convo...
In a recent paper [1], Truong et al. have presented a new method for computing two-dimensional convo...
Abstract: Discrete transforms are introduced and are defined in a ring of polynomials. These polynom...
[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs...
[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs...
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings42180-...
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D Number T...
We present a very simple and fast algorithm to compute the convolution of an arbitrary sequence x wi...
Click on the DOI link to access the article (may not be free)Conventional two dimensional fast Fouri...
AbstractA classical scheme for multiplying polynomials is given by the Cauchy product formula. Faste...
AbstractIn this paper, we consider the related problems of convolution and polynomial multiplication...
Abstract. A polynomial transform is the multiplication of an input vector x ∈ Cn by a matrix Pb;α ∈ ...
A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the ...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...
International audienceWe describe new fast algorithms for evaluation and interpolation on the "novel...