High-Performance Fast Fourier Transformer

The fast Fourier transformer described is a random logic implementation of the Radix 2 decimation-in-time algorithm. A 256-point complex time slice can be transformed into a 256-point complex frequency spectrum in less than 5.3 ms. All of the 1024 multiplications and 2048 additions are performed in a single computational unit in block floating point, two´s-complement arithmetic. The complex multiplications are performed using the Liu-Peled method which directly results in the final complex product without determining the intermediate products.