Digital fourier transformers with arbitrary parallelism

Three different structures for computing the Digital Fourier Transform on N elements are given. Every structure generates P coefficients (with P dividing N) at every computational step. These structures are evaluated in terms of hardware requirements and their operation speed is discussed.