Abstract
The current paper introduces an efficient technique for parallel data addressing in FFT architectures performing in-place computations. The novel addressing organization provides parallel load and store of the data involved in radix-r butterfly computations and leads to an efficient architecture when r is a power of 2. The addressing scheme is based on a permutation of the FFT data, which leads to the improvement of the address generating circuit and the butterfly processor control. Moreover, the proposed technique is suitable for mixed radix applications, especially for radixes that are powers of 2 and straightforward continuous flow implementation. The paper presents the technique and the resulting FFT architecture and shows the advantages of the architecture compared to hitherto published results. The implementations on a Xilinx FPGA Virtex-7 VC707 of the in-place radix-8 FFT architectures with input sizes 64 and 512 complex points validate the results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Parker, D.S. (1980). Notes on Shuffle/Exchange-Type Switching Networks. IEEE Transactions on Computers, C-29(3), 213–222.
Wold, E.H., & Despain, A.M. (1984). Pipeline and Parallel FFT Processors for VLSI Implementations. IEEE Transactions on Computers, C-33, 414–426.
Johnson, L.G. (1992). Conflict Free Memory Addressing for Dedicated FFT Hardware. IEEE Transactions on Circuits and Systems - II: Analog and Digital Signal Processing, 39(5), 312–316.
Ma, Y. (1999). An effective memory addressing scheme for FFT processors. IEEE Transactions on Signal Processing, 47(3), 907–911.
Xiao, X., Oruklu, E., Saniie, J. (2008). An efficient FFT engine with reduced addressing logic. IEEE Transactions on Circuits and Systems II: Express Briefs, 55(11), 1149–1153.
Takala, J.H., Järvinen, T.S., Sorokin, H.T. (2003). Conflict-Free Parallel Memory Access Scheme for FFT Processors. In The Proceedings of the Intelligent Symposium on Circuits and Systems, ISCAS, (Vol. 4 pp. 524–527).
Reisis, D., & Vlassopoulos, N. (2008). Conflict free parallel memory accessing techniques for FFT architectures. IEEE Transactions on Circuits and Systems I, 55(11), 3438–3447.
Nakos, K., Reisis, D., Vlassopoulos, N. (2008). Addressing technique for parallel memory accessing in Radix-2 FFT processors. In The Proceedings of the IEEE ICECS (pp. 52–56).
Pease, M. (1969). Organization of large scale Fourier transforms. Journal of the ACM, 16, 474–482.
Cohen, D. (1976). Simplified control of FFT hardware. IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-24, 577–579.
Püschel, M., Milder, P.A., Coe, J.C. (2009). Permuting streaming data using RAMs. Journal of the ACM, 56(2), 10.
Ayinala, M., Lao, Y., Parhi, K.K. (2013). An in-place FFT architecture for real-valued signals. IEEE Transactions on Circuits and Systems—II: Express Briefs, 60, 10.
Jo, B.G., & Sunwoo, M.H. (2005). New continuous-flow mixed-radix (CFMR) FFT processor using novel in-place strategy. Transactions on Circuits and Systems I, 52(5), 911–919.
Jacobson, A.T., Truong, D.N., Baas, D.M. (2009). The design of a reconfigurable continuous-flow mixed-radix FFT processor. In ISCAS 2009 IEEE International Symposium on Circuits and Systems.
Rabaey, J.M., Chandrakasan, A., Nikolic, B. (2003). Digital Integrated Circuits, Pearson. ISBN-13 978-0130909961.
Franchetti, F., & Puschel, M. (2011). Fast Fourier Transform Encyclopedia of Parallel Computing. ISBN 978-0-387-09765-7.
DFT/FFT IP Core Generator, http://www.spiral.net/hardware/dftgen.html.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kitsakis, V., Nakos, K., Reisis, D. et al. Parallel Memory Accessing for FFT Architectures. J Sign Process Syst 90, 1593–1607 (2018). https://doi.org/10.1007/s11265-018-1387-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-018-1387-2