Storage-free method for computing fast Fourier transforms (FFT) rotation, involves computing rotations of FFT using modified CORDIC algorithm to simplify micro-rotation computing block

摘要

The FFT is computed without using stored data according to Cooley-Tukey algorithm. The rotation angle of the FFT steps is generated by a single counter (1) and a circuit comprising several adders and logic gates. The rotations are computed using modified CORDIC algorithm to simplify the micro-rotation computing block. An independent claim is included for storage free architecture.