Abstract: A method for computing a fast Fourier Transform of an input signal which includes the steps of: a) storing first and second data values and a first coefficient in a first register stage; b) storing the first and second data values and the first coefficient in a second register stage and storing third and fourth data values in the first register stage along with a second coefficient; c) multiplying the second data value by the first coefficient and storing the product in a third register stage along with the first data value, moving the third and fourth data values into the second register stage along with the second coefficient and storing fifth and sixth data values in the first register stage along with a third coefficient; d) combining the first data value with the product of the first coefficient and the second data value and storing the result in a fourth register stage; e) combining the third data value with the product of the second coefficient and the fourth data value and storing the result in the fo