Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field

The discrete Fourier transform over a finite field with reduced multiplicative complexity

2011 IEEE International Symposium on Information Theory Proceedings ◽

10.1109/isit.2011.6033725 ◽

2011 ◽

Cited By ~ 5

Author(s):

Sergei V. Fedorenko

Keyword(s):

Fourier Transform ◽

Finite Field ◽

Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

Electronics Letters ◽

10.1049/el:19880380 ◽

1988 ◽

Vol 24 (9) ◽

pp. 559 ◽

Cited By ~ 2

Author(s):

W. Ma ◽

D. Yang

Keyword(s):

Fourier Transform ◽

Two Dimensional ◽

The multiplicative complexity of the Discrete Fourier Transform

Advances in Applied Mathematics ◽

10.1016/0196-8858(84)90005-8 ◽

1984 ◽

Vol 5 (1) ◽

pp. 87-109 ◽

Cited By ~ 8

Author(s):

L Auslander ◽

E Feig ◽

S Winograd

Keyword(s):

Fourier Transform ◽

On the multiplicative complexity of the Discrete Fourier Transform

Advances in Mathematics ◽

10.1016/0001-8708(79)90037-9 ◽

1979 ◽

Vol 32 (2) ◽

pp. 83-117 ◽

Cited By ~ 49

Author(s):

S Winograd

Keyword(s):

Fourier Transform ◽

Multiplicative Complexity, Convolution, and the DFT - Signal Processing and Digital Filtering ◽

Multiplicative Complexity of Discrete Fourier Transform

10.1007/978-1-4612-3912-3_5 ◽

1988 ◽

pp. 76-107

Author(s):

Michael T. Heideman

Keyword(s):

Fourier Transform ◽

Two-dimensional discrete Fourier transform with small multiplicative complexity using number theoretic transforms

IEE Proceedings G (Electronic Circuits and Systems) ◽

10.1049/ip-g-1.1984.0043 ◽

1984 ◽

Vol 131 (6) ◽

pp. 234

Author(s):

O.R. Hinton ◽

R.A. Saleh

Keyword(s):

Fourier Transform ◽

Two Dimensional ◽

A method for computation of the discrete Fourier transform over a finite field

Problems of Information Transmission ◽

10.1134/s0032946006020074 ◽

2006 ◽

Vol 42 (2) ◽

pp. 139-151 ◽

Cited By ~ 17

Author(s):

S. V. Fedorenko

Keyword(s):

Fourier Transform ◽

Finite Field ◽

Discrete Fourier Transform

Minimum multiplicative complexity algorithm for computing a single component of the discrete Fourier transform

Digital Signal Processing ◽

10.1016/j.dsp.2013.01.003 ◽

2013 ◽

Vol 23 (3) ◽

pp. 1040-1043 ◽

Cited By ~ 1

Author(s):

Gilson Jerônimo da Silva ◽

Ricardo Menezes Campello de Souza

Keyword(s):

Fourier Transform ◽

Single Component ◽

Multiplicative Complexity ◽

Complexity Algorithm

Processor arrays for two-dimensional discrete Fourier transform

IEE Proceedings E Computers and Digital Techniques ◽

10.1049/ip-e.1993.0014 ◽

1993 ◽

Vol 140 (2) ◽

pp. 101

Author(s):

D.V. Korchev ◽

Ju.S. Kanevsky

Keyword(s):

Fourier Transform ◽

Two Dimensional ◽

Processor Arrays

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

Randomness Test to Solve Discrete Fourier Transform Test Problems

10.1587/transfun.e101.a.1204 ◽

2018 ◽

Vol E101.A (8) ◽

pp. 1204-1214 ◽

Cited By ~ 1

Author(s):

Atsushi IWASAKI ◽

Ken UMENO

Keyword(s):

Fourier Transform ◽

Test Problems ◽

Randomness Test