Fast Fourier transforms over finite groups by multiprocessor systems

The authors present a method for an optimal implementation of general discrete Fourier transform (GDFT) algorithms over finite groups (Abelian and non-Abelian) in a multiprocessor environment. Tradeoffs between hardware complexity/speed and computation time are investigated for different multiprocessor implementations with local nonshared memories (unibus, complete communication network). Formulas are presented for the number of arithmetic operations, for the number of interprocessor data transfers, and for the number of communication links among the processors.<
>