Low-cost memory data scheduling method for reconfigurable FFT bit-reversal circuits

Low-cost memory data scheduling method for reconfigurable FFT bit-reversal circuits

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A low-cost memory data scheduling method based on two N/2-depth single-port memories is proposed for reconfigurable fast Fourier transform (FFT) bit-reversed data reordering tasks. To make single-port memories have the equivalent ability to read and write data simultaneously, two types of read and write address generation methods are proposed. Based on the proposed data scheduling method, the bit-reversal circuits are designed for continuous data reordering tasks. The proposed bit-reversal design is implemented for a maximum 8 k flexible length FFT processor. Compared with the other two conventional methods, the proposed bit-reversal method can reduce memory area cost by 53.8 and 46.1%, respectively.


    1. 1)
    2. 2)
    3. 3)
      • 3. Chakraborty, T.S., Chakrabarti, S.: ‘On output reorder buffer design of bit reversed pipelined continuous data FFT architecture’. IEEE Asia Pacific Conf. on Circuits and System, Macao, China, December, 2008, pp. 11321135.
    4. 4)
      • 4. Kristensen, F., Nilsson, P., Olsson, A.: ‘Reduced transceiver-delay for OFDM systems’. IEEE Vehicular Technical Conf., Los Angeles, CA, USA, September, 2004, pp. 12421245.

Related content

This is a required field
Please enter a valid email address