On the parametrization of algebraic discrete fourier transforms Conference Paper uri icon

abstract

  • Springer-Verlag Berlin Heidelberg 1997. Computing the Discrete Fourier Transform (DFT) of signals over some finite field Fq often requires an extension to a large field Fqn containing an appropriate primitive root of unity. The Algebraic Discrete Fourier Transforms (ADFTs) avoid the extension of the basefield Fq and can be used to compute the spectrum of the DFT. We derive a complete parametrization of ADFT matrices and show how this knowledge can be employed to derive VLSI realizations with low implementation complexity.

published proceedings

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

  • Nckel, A., & Klappenecker, A.

citation count

  • 0

complete list of authors

  • Nückel, Armin||Klappenecker, Andreas

editor list (cited editors)

  • Pichler, F., & Moreno-Díaz, R.

publication date

  • January 1997