@article{3024456,
    title = "Parallel Memory Accessing for FFT Architectures",
    author = "Kitsakis, V. and Nakos, K. and Reisis, D. and Vlassopoulos, N.",
    journal = "Journal of Signal Processing Systems",
    year = "2018",
    volume = "90",
    number = "11",
    pages = "1593-1607",
    publisher = "Springer New York LLC",
    issn = "1939-8018, 1939-8115",
    doi = "10.1007/s11265-018-1387-2",
    keywords = "Fast Fourier transforms;  Field programmable gate arrays (FPGA);  Memory architecture, Addressing scheme;  Butterfly processor;  Continuous flows;  Efficient architecture;  FPGA implementations;  In-place computation;  Parallel loads;  Parallel memory, Parallel architectures",
    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. © 2018, Springer Science+Business Media, LLC, part of Springer Nature."
}