Prime-factor FFT algorithm

About: Prime-factor FFT algorithm is a research topic. Over the lifetime, 2346 publications have been published within this topic receiving 65147 citations. The topic is also known as: Prime Factor Algorithm.

Use of single bin Fourier transform algorithm for high speed tone detection and parallel processing

Abstract: Fourier transform is the classical tool for performing spectral analysis of a short-duration signal and fast Fourier transform (FFT) is the widely used algorithm for achieving the same with a high degree of computational efficiency. Recently a “single bin Fourier transform algorithm” has been proposed by the present authors, which is designed to compute the spectral amplitude and phase of a single frequency present in the time signal to be analyzed. The traditional detection scheme involves sampling the analog signal first using the Nyquist's sampling theorem, apply the FFT on the sampled signal and then identify the desired frequency from the FFT output. However, in case of tone detection, only the presence of a single frequency is to be tested. The computation of the whole FFT output dataset is superfluous in this case. In this paper, we have used the single bin Fourier transform algorithm for tone detection, which makes the detection scheme less complex and computationally more efficient than the traditional FFT algorithm. Moreover, the method of parallel processing can be applied to make the system more efficient in detecting the existence of more than one frequency component present in the incoming signal. The main objective of the proposed scheme is to improve the detection speed of a single frequency, or a narrow band of frequencies, present in a signal.

A cooley-tukey modified algorithm in fast fourier transform

Abstract: We would like to propose a Cooley-Tukey modified al- gorithm in fast Fourier transform(FFT). Of course, this is a kind of Cooley-Tukey twiddle factor algorithm and we focused on the choice of integers. The proposed algorithm is better than existing ones in speeding up the calculation of the FFT.

Implementation of a Fast Fourier Transform Algorithm Based on FPGA

Abstract: Based on the analysis of four kinds of typical structure of Fast Fourier Transform(FFT) algorithm,a recursive structure of FFT on radix-2 single butterfly processing element sampled by time is presented. A 64 points FFT is implemented on the Cyclone EP1C6T144C7 device. The result of the simulation shows that the resource consumption requires 967 logical elements and the top frequency can reach 56.47 MHz. Through reducing the multiplication number of butterfly processing elements and using ping-pang RAM structure,less hardware resource requirement and high speed is obtained.

Design and Simulation of FFT Processor Using Radix-4 Algorithm Using FPGA

Abstract: A parallel and pipelined Fast Fourier Transform (FFT) processor for use in the Orthogonal Frequency division Multiplexer (OFDM) and WLAN, unlike being stored in the traditional ROM. The twiddle factors in our pipelined FFT processor can be accessed directly. A novel simple address mapping scheme and the modified radix 4 FFT also proposed. FPGA was majorly used to develop the ASIC IC’s to which was implemented. Here we simulated and synthesized the 256- point FFT with radix-4 using VHDL coding and 64 point FFT Hardware implementation we designed code using System C. Finally, the pipelined 256-point FFT processor can be completely implemented within 19.103ns.

A Simple and Fast Spline Filtering Algorithm for Surface Metrology.

Abstract: Spline filters and their corresponding robust filters are commonly used filters recommended in ISO (the International Organization for Standardization) standards for surface evaluation. Generally, these linear and non-linear spline filters, composed of symmetric, positive-definite matrices, are solved in an iterative fashion based on a Cholesky decomposition. They have been demonstrated to be relatively efficient, but complicated and inconvenient to implement. A new spline-filter algorithm is proposed by means of the discrete cosine transform or the discrete Fourier transform. The algorithm is conceptually simple and very convenient to implement.