A variant of Cooley-Tuckey algorithm with local memory management
J.-M. Bourguet, T. Nancy, Shao-Jun Wei, J. Leroy, R.G. Crappe · 1995
We hereby introduce an extension of the Cooley-Tuckey algorithm (CT) aimed at increasing the temporal locality of memory references. It enables to reduce the stress on external accesses by using a small fast on-chip memory. So it is suitable for large Discrete Fourier Transform (DFT). Configurations of the algorithm parameters according to different optimisation criteria are detailed and a real ASIC application for image processing is described. 1.