liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A hardware efficient control of memory addressing for high-performance FFT processors
Royal Inst Technol, Dept Elect, Stockholm, Sweden Linkoping Univ, Dept Elect Engn, S-58183 Linkoping, Sweden.
Linköping University, The Institute of Technology. Linköping University, Department of Electrical Engineering, Electronics System.
2000 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, Vol. 48, no 3, 917-921 p.Other (Other academic)
Abstract [en]

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.
Keyword [en]
conflict-free memory addressing, fast Fourier trasform, FFT coefficient access, low-power FFT processors
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-49830OAI: diva2:270726
Available from: 2009-10-11 Created: 2009-10-11

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Wanhammar, Lars
By organisation
The Institute of TechnologyElectronics System
In the same journal
IEEE Transactions on Signal Processing
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 81 hits
ReferencesLink to record
Permanent link

Direct link