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.

A High-accuracy Integrated Frequency Estimator for Real Sine Signal

Abstract: In this paper,we firstly deduce the theoretical discrete Fourier tran sform expression of single frequency signal,and then discuss in detail the prin ciple of FFT frequency estimator and other two interpolation estimator FFT real part and FFT subsection.Both algorithms improve the performance of FFT estimato r based on the interpolation of spectrum line.Considering disadvantages of two methods,we put forward an integrated frequency estimator which combines advanta ges of two algorithms.The computer simulation shows that the integrated frequen cy estimator is better than the original algorithms in stabilization and accurac y.

Disparity Estimation Based on Frequency Domain

Abstract: A generalized wavelet transform multiscale Fourier transform was adopted in estimating disparities between a stereo pair, by which traditional phase based stereo matching is improved. It can avoid the problem that the character frequency is significantly different from the center frequency of bandpass filter and directly compute 2 D disparities and match the images without relative and absolute caliberation. The algorithm can obtain high computing efficiency by FFT. The experiments show the algorithm is practicable.

Identification of measurement data processing algorithm coefficients presented on selected form of fft algorithm

Abstract: Nowadays measurement data coming from all kinds of measurement systems is usually processed by algorithms. These algorithms are often delivered to the user as complex program and their numerical structure is not known. Therefore also influence of algorithm on an accuracy of processed data is not known. Coefficient matrix of algorithm represents its numerical operations and it can be a basis to algorithm accuracy evaluation. The paper presents a method how to identify this coefficient matrix. As an example this method is used to identify an FFT algorithm implemented in LabVIEW.

VLSI based Pipelined Architecture for Radix-8 Combined SDF-SDC FFT

Abstract: Background: Fast Fourier Transform (FFT) operation is one of the most important fundamental operations in the digital signal processing systems. In this paper, a new pipelined Radix-8 based Fast Fourier Transformation (FFT) architecture is designed for performing frequency transformation techniques. The objective of this paper is to improve the speed and to reduce the area, delay and power. Methods: Radix-8 FFT, which is used to improve the speed of functioning by reducing the computational path. In the proposed new architecture named as “Radix-8 combined SDF-SDC FFT”. In this architecture, the numbers of stages are reduced to 75%. The first two stages are designed using Single path delay feedback and the last two stages are designed using single-path-delay Commutator. The combined SDF-SDC FFT is to increasing the processing speed of architecture. In the proposed “pipelined Radix-8 combined SDF-SDC FFT’’ is designed in this article. Findings: In the existing Radix-8 SDF FFT, the number of stages is increased. In order to reduce the number of stages, Radix-8 combined SDF-SDC FFT has been proposed. The performance evaluation of Radix-8 combined SDF-SDC FFT architecture is determined through Very Large Scale Integration (VLSI) system design environment. In the VLSI system design, less area utilization, low power consumption and high speed are the main parameters. Hence, the main goal of proposed architecture is to reduce hardware complexity, power consumption and increasing both speed and throughput of the system. Applications: Mobile Ad-hoc Network (MANET), Orthogonal Frequency Division Multiplexing (OFDM) System, Telecommunication networking system are considered as the important applications of proposed radix-8 combined SDF-SDC FFT.

An efficient polar coordinate system Fourier transform algorithm

Abstract: The problem of efficiently computing the discrete Fourier transform (DFT) of data acquired in an r= theta polar coordinate system has received considerable attention over the last 30 years. The interest in the problem has come from several different fields, including antenna and RCS (radar cross section) measurements, radio astronomy, and medical imaging. The author presents an alternative algorithm that offers advantages in some circumstances, particularly when it is desirable to process a limited number of theta angles. This algorithm transforms data from samples evenly spaced in r at arbitrary theta angles to an evenly spaced Cartesian spectrum. In order to verify the validity of the zero-order hold interpolation scheme, a test was performed to see how well the inverse transformation could reproduce an original distribution. A full-resolution aperture was synthesized with a uniform illumination and transformed using the polar Fourier transform algorithm combined above, padding the 1D fast Fourier transforms to eight times the output dimensions. >