Topic
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.
Papers published on a yearly basis
Papers
More filters
••
14 Nov 2014TL;DR: A parallel algorithm for a direct solution of customized Fourier transform was proposed using a general processing unit (GPU) and was applied to non-integer Fouriertransform (NFT).
Abstract: A parallel algorithm for a direct solution of customized Fourier transform was proposed using a general processing unit (GPU). The algorithm was derived from parallel addition and multiplication, and was applied to non-integer Fourier transform (NFT). The parallel NFT was targeted to improve the resolution in 3D RF profile measurement. The proposed algorithm was efficient in processing time through consideration of the amount of operation using recent parallel FFT (Radix-2).Copyright © 2014 by ASME
1 citations
•
TL;DR: The calculus and experiments of the algorithm which show the accuracy of 1 pixel are provided, which estimates the movements from the whole field of the image with excellent global property.
Abstract: The problem of estimating the motions in image sequences has been extensively studied.By shift theory of Fourier transform an algorithm for estimating displacement of both the moving target and background is presented.Utilizing the relation between the two Fourier transform of a couple of images,the method employs the displacement value of the moving target and background by the different of Fourier phase spectrum.This paper provides the calculus and experiments of the algorithm which show the accuracy of 1 pixel.The algorithm estimates the movements from the whole field of the image with excellent global property.
1 citations
01 Jan 2005
TL;DR: A protection algorithm can be judged as having strong capability of anti-interference if it can eliminate decaying direct current component and high harmonic whose frequency is not the integer times of system base-frequency.
Abstract: A protection algorithm can be judged as having strong capability of anti-interference if it can eliminate decaying direct current component and high harmonic whose frequency is not the integer times of system base-frequency.After introducing the correlative theory of phaselet algorithm and analyzing Fourier algorithm and improved Fourier algorithm,the ability of eliminating harmonic current and decaying direct current component of these algorithms are analyzed and compared,and conclusions are given.
1 citations
••
18 Aug 1996TL;DR: In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented that uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix 1-D algorithm.
Abstract: In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented. This algorithm uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix-2 2-D algorithm. Computational complexity and run-time comparison of the algorithm are also provided.
1 citations
•
TL;DR: An improved FFT-based algorithm for SAR raw data compression is proposed and the analyzed result indicates that the improved algorithm decreases the complex level and hardware requirements and keeps the excellent performance compared with the original F FT-BAQ.
Abstract: In order to solve the difficult implementation of the synthetic aperture radar(SAR) raw data compression algorithm based on fast Fourier transform-based block adaptive quantization(FFT-BAQ),the energy distributing of SAR raw data after two dimensions frequency transform is analyzed,and optimum bits allocation scheme is designed based on Shannon rate-distortion theory and information resource differential entropy.An improved FFT-based algorithm for SAR raw data compression is proposed.The complex level of this improved algorithm is analyzed,and the analyzed result indicates that the improved algorithm decreases the complex level and hardware requirements and keeps the excellent performance compared with the original FFT-BAQ.
1 citations