Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806)

The algebraic discrete Fourier transform (ADFT) over finite fields was introduced by \textit{T. Beth} [Verfahren der schnellen Fourier- Transformation (1984; Zbl 0536.65098)]. Now using the normal basis concept, the ADFT for finite commutative rings with identity is defined. The connection between the ADFT, the minimal polynomial transform and the so-called ``reduced transform'' is described. This generalized ADFT has similar properties as the ``classical'' ADFT and can be applied to fast cyclic convolutions due to suitable hardware implementations.