## Prime factor algorithms for Real 8211;valued series

- M. T. Heideman, H. W. Johnson, C. S. Burrus
- In Proceedings of the IEEE International…
- 1984

1 Excerpt

- 2016

FFT algorithms is one of the many methods used for the calculation of DFT, but they are preferred due to their increased speed and higher efficiency, which arises due to the fact that for the calculation of a N-point DFT, the sequence is broken into several segments and the DFT for each segment is calculated. However, for this many redundant memory spaces are required. The Butterfly structure for the calculation of DFT by FFT algorithms is preferred due to its symmetry which makes it suitable for hardware implementations, but this requires the loading of the twiddle factors for each stage repeatedly, which leads to inefficient use of memory space. To overcome this, grouping the identical twiddle factors of different stages together reduces the number of memory references and the storage space due to twiddle factors, therein reducing the number of clock cycles needed for the complete implementation of the algorithm. Thus this can be an efficient method for the calculation of FFT algorithms.