We show that the polar as well as the pseudo-polar FFT can be computed very accurately and efficiently by the well known nonequispaced FFT. Furthermore, we discuss the reconstruction of a 2d signal from its Fourier transform samples on a (pseudo-)polar grid by means of the inverse nonequispaced FFT.

We present a novel pipelined Fast Fourier Transform (FFT) architecture which is capable of producing the output sequence in normal order. The Fast Fourier Transform (FFT) is periodically employed in the algorithms of signal processing for the applications of Orthogonal Frequency Division Multiplexing (OFDM). In this paper, a new pipelined 32 point Mixed Single-path Delay FeedbackMulti-path Dela...

The Radix-4 Fast Fourier Transform (FFT) is widely accepted for signal processing applications in wireless communication system. Here, we present a new Radix-4 FFT which reduces the operational count by 6% lesser than standard Radix-4 FFT without losing any arithmetic accuracy. Simulation results are also given for the verification of the algorithm.

Treatment outcomes for adolescent substance abuse at 4– and 7–month assessments. QUESTION: Does cognitive behavioural therapy (CBT), functional family therapy (FFT), combined FFT and CBT, or a group psychoeducational intervention reduce adolescent substance abuse? Design Randomised (unclear allocation concealment*), unblinded*, controlled trial with 7 months of follow up. Patients 120 adolescen...

In this paper BP neural network is used for signal processing of automobile millimeter wave radar instead of FFT(Fast Fourier Transform). Simulation results show that BP neural network is superior to FFT. FFT has the drawback such as large computation and frequency spectrum leakage. The BP neural network has three layers(one input layer, one hidden layer, one output layer).The network is traine...

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...

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...