AbstractWe show how to compute the multiplicative complexity of the Discrete Fourier Transform on any set of data points
AbstractFor small primes the minimal multiplication algorithms of Winograd can be expressed as the e...
A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete...
AbstractBy generalizing the algebraic discrete Fourier transform (ADFT) for finite commutative rings...
AbstractWe show how to compute the multiplicative complexity of the Discrete Fourier Transform on an...
AbstractMost results in multiplicative complexity assume that the functions to be computed are in th...
AbstractMultiplicative character theory will be used to reprove results from a paper of Auslander-Fe...
AbstractIn this paper the complexity of computing the General Discrete Fourier Transform over group ...
AbstractSince the pioneering work of J. W. Cooley and J. W. Tukey Math. Comp. 19 1965 297–301, a gre...
AbstractWe obtain the multiplicative complexity of discrete cosine transforms in all cases. It is gi...
Let A = (aij) be an n x n matrix. Consider the discrete transform u + Au, and asso...
This paper introduces the theory and hardware im-plementation of two new algorithms for computing a ...
AbstractThe discrete Fourier transform (DFT) is an important operator which acts on the Hilbert spac...
This self-contained book introduces readers to discrete harmonic analysis with an emphasis on the Di...
AbstractComplexity measures for sequences of elements of a finite field play an important role in cr...
AbstractLet A = (aij) be an n × n matrix. Consider the discrete transform u → Au, and associate with...
AbstractFor small primes the minimal multiplication algorithms of Winograd can be expressed as the e...
A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete...
AbstractBy generalizing the algebraic discrete Fourier transform (ADFT) for finite commutative rings...
AbstractWe show how to compute the multiplicative complexity of the Discrete Fourier Transform on an...
AbstractMost results in multiplicative complexity assume that the functions to be computed are in th...
AbstractMultiplicative character theory will be used to reprove results from a paper of Auslander-Fe...
AbstractIn this paper the complexity of computing the General Discrete Fourier Transform over group ...
AbstractSince the pioneering work of J. W. Cooley and J. W. Tukey Math. Comp. 19 1965 297–301, a gre...
AbstractWe obtain the multiplicative complexity of discrete cosine transforms in all cases. It is gi...
Let A = (aij) be an n x n matrix. Consider the discrete transform u + Au, and asso...
This paper introduces the theory and hardware im-plementation of two new algorithms for computing a ...
AbstractThe discrete Fourier transform (DFT) is an important operator which acts on the Hilbert spac...
This self-contained book introduces readers to discrete harmonic analysis with an emphasis on the Di...
AbstractComplexity measures for sequences of elements of a finite field play an important role in cr...
AbstractLet A = (aij) be an n × n matrix. Consider the discrete transform u → Au, and associate with...
AbstractFor small primes the minimal multiplication algorithms of Winograd can be expressed as the e...
A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete...
AbstractBy generalizing the algebraic discrete Fourier transform (ADFT) for finite commutative rings...
DOI
Add to ORKG