A hardware efficient control of memory addressing for high-performance FFT processors
2000 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, Vol. 48, no 3, 917-921 p.Other (Other academic)
The conventional memory organization of fast Fourier transform (FFT) processors is based on Cohen's scheme, Compared Kith this scheme, our scheme reduces the hardware complexity of address generation by about 50% while improving the memory access speed, Much power consumption in memory is saved since only half of the memory is activated during memory access, and the number of coefficient access is reduced to a minimum by using a nem ordering of FFT butterflies. Therefore, the new scheme is a superior solution to constructing high-performance FFT processors.
Place, publisher, year, edition, pages
2000. Vol. 48, no 3, 917-921 p.
conflict-free memory addressing, fast Fourier trasform, FFT coefficient access, low-power FFT processors
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-49830OAI: oai:DiVA.org:liu-49830DiVA: diva2:270726