© The Institution of Engineering and Technology
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.
References
-
-
1)
-
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. 1132–1135.
-
2)
-
1. Yang, S.-W., Lee, J.-Y.: ‘Constant twiddle factor multiplier sharing in multipath delay feedback parallel pipelined FFT processors’, Electron. Lett., 2014, 50, (15), pp. 1050–1052 (doi: 10.1049/el.2014.1186).
-
3)
-
2. Garrido, M., Grajal, J., Gustafsson, O.: ‘Optimum circuits for bit reversal’, IEEE Trans. Circuits Syst. II, Express Briefs, 2011, 58, (10), pp. 657–661 (doi: 10.1109/TCSII.2011.2164141).
-
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. 1242–1245.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.3715
Related content
content/journals/10.1049/el.2014.3715
pub_keyword,iet_inspecKeyword,pub_concept
6
6