An effective memory addressing scheme for FFT processors

The memory organization of FFT processors is considered. The new memory add ressing assignment allows simultaneous access to all the data needed for bu tterfly calculations. The advantage of this memory addressing scheme lies i n the fact that it reduces the delay of address generation nearly by half c ompared to existing ones.