An improved fast Fourier transform algorithm using mixed frequency and time decimations

An improved FFT (fast Fourier transform) algorithm combining both decimations in frequency and in time is presented. Stress is placed on a derivation of general formulas for submatrices and multiplicands. Computational efficiency is briefly discussed.<
>