We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. Our algorithm uses a recursive divide-and-conquer strategy, and each stage in the recursion presents several possibilities for how to split the problem into subproblems. We give a recurrence for the algorithm's I/O complexity on the Parallel Disk Model and show how to use dynamic programming to de...

Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less mathematical operations than many state-of-the-art algorithms. Most split-radix FFT algorithms are implemented in a recursive way which brings much extra overhead of systems. In this paper, we propose an algorithm of split-radix FFT that can eliminate the system overhead...

Historically, in computational biology the fast Fourier transform (FFT) has been used almost exclusively to count the number of exact letter matches between two biosequences. This paper presents an FFT algorithm that can compute the match score of a sequence against a position-specific scoring matrix (PSSM). Our algorithm finds the PSSM score simultaneously over all offsets of the PSSM with the...

Fast Fourier transform (FFT) is the demodulation kernel in the DVB-H system. In this paper, we firstly propose an FFT processor that reduces the power consumption by decreasing the usage of main memory, and timely turning off the unused memory partitions in different sizes of the FFT. Second, the triple-mode conflict-free address generator is proposed to handle the address mapping of all storag...

In this letter, an area-efficient FFT processor is proposed for MIMO-OFDM based SDR systems. The proposed FFT processor can support variable lengths of 64, 128, 256, 512, 1024, 1536 and 2048. By reducing the required number of non-trivial multipliers with a mixed-radix algorithm, the complexity of the proposed FFT processor is dramatically decreased. The proposed FFT processor was designed in a...

This paper presents a high-throughput lowcomplexity 512-point eight-parallel mixed-radix multipath delay feedback (MDF) fast Fourier transform (FFT) processor architecture for orthogonal frequency division multiplexing (OFDM) applications. To decrease the number of twiddle factor (TF) multiplications, a mixed-radix 2/2 FFT algorithm is adopted. Moreover, a dual-path shared canonical signed digi...

FFT algorithms optimized to achieve high performance on a speciic parallel computer architecture are not portable without a reduction in performance. The main objective of this paper is to present a portable FFT algorithm that runs eeciently on diierent parallel computer systems. This goal can only be achieved if the algorithm is able to adapt itself to the computer system it runs on. The struc...

In our previous study, we proposed a post FFT frequency domain adaptive antenna array (FD-AAA) algorithm for the uplink detection in the broadband single-carrier multiple access system. In the post-FFT algorithm, the AAA weights on different frequencies are calculated respectively. In this study, we will compare the performance of the proposed algorithm with the pre-FFT type algorithm where the...

Without doubt, the fast Fourier transform (FFT) belongs to the algorithms with large impact on science and engineering. By appropriate approximations, this scheme has been generalized for arbitrary spatial sampling points. This so called nonequispaced FFT is the core of the sequential NFFT3 library and we discuss its computational costs in detail. On the other hand, programmable graphics proces...

This paper presents a single-chip 128point FFT processor based on the cached-memory architecture (CMA) with the resource Mixed Radix 4-2 computation element. The 4-2-stage CMA, including a pair of single-port SRAMs, is introduced to increase the execution time of the 2dimensional FFT’s. Using the above techniques, we have designed an FFT processor core which integrates 5,52,000 transistors with...