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
TL;DR: A two-dimensional Hartley transform algorithm is outlined and demonstrated to provide the same level of analytical capability as the Fourier transform algorithm but with improvements in processing speed.
31 Oct 2008
TL;DR: This paper discusses the phase compensation of R-IpD/FFT, a proposed recursive interpolated discrete/fast Fourier transform for on-line calculation that has higher accuracy than the existing one.
Abstract: Discrete/fast Fourier transform (D/FFT) has been widely used for diagnosis of power equipment. D/FFT inevitably has the inherent drawbacks. As one of the methods to overcome the drawbacks, interpolated discrete/fast Fourier transform (IpD/FFT) has been proposed. IpD/FFT has higher accuracy. We proposed recursive interpolated discrete/fast Fourier transform (R-IpD/FFT) for on-line calculation. In this paper, we discuss the phase compensation of R-IpD/FFT.
01 Jun 2006
TL;DR: By transforming the decimal TH-CF into a binary one, a fast TH- CF algorithm is proposed on the basis of the well-known fast Fourier transform (FFT) which will result in significant improvement in the computer-based evaluation of TH correlation properties.
Abstract: Time-hopping (TH) sequences play an important role in time-hopping ultra wideband (TH-UWB) communication systems. The proper measure for the performance of TH sequences is time-hopping correlation function (TH-CF). For TH sequences with a long period, the total number of computations to implement directly TH-CF will be huge, and it will increase very rapidly as the period increases. Hence, it is of practical interest to develop more efficient algorithm for computing TH-CF. In this paper, by transforming the decimal TH-CF into a binary one, a fast TH-CF algorithm is proposed on the basis of the well-known fast Fourier transform (FFT). The presented algorithm can obviously decrease the number of computations of TH-CF, which will result in significant improvement in the computer-based evaluation of TH correlation properties.
Patent•
21 May 2012
TL;DR: In this article, a mapping iterative algorithm for mixed base FFT (fast fourier transform) final stage reordering is proposed, which is a necessary link for guaranteeing the realization of queue order output under the condition of adopting a DIF-FFT (decimation in frequency-fast Fourier transform).
Abstract: The invention belongs to the technical field of digital integrated circuits and systems, and particularly relates to a mapping iterative algorithm for realizing mixed base FFT (fast fourier transform) final stage reordering. A final stage reordering module of an FFT is a necessary link for guaranteeing the realization of queue order output under the condition of adopting a DIF-FFT (decimation in frequency-fast fourier transform) algorithm. The treatment on this problem in the past commonly adopts a bit-reversal algorithm, but the bit-reversal algorithm is limited by the fact that input point must meet certain requirements, and universality is not achieved. The invention provides the mapping iterative algorithm in view of this situation, so that natural order output of sequence can be achieved when an arbitrary input point is an integer power of 2, and a uniform reordering algorithm to the FFT disintegrated by the way in which the arbitrary input point is a non-zero natural number mixed base is provided.
01 Apr 1979
TL;DR: This comparison shows that the relative time efficiency of the two algorithms in sequential computations generally carries over to cases where arithmetic parallelism is exploited.
Abstract: Arithmetic concurrencies, such as those found in special-purpose fast Fourier transform (FFT) hard-ware, are surveyed and categorized. Similar structures are then derived for the Winograd Fourier transform algorithm (WFTA). Relative time-efficiency plots are obtained for the 1024-point radix-4 FFT and the 1008-point WFTA as a function of the number of real arithmetic operations executable in parallel. This comparison shows that the relative time efficiency of the two algorithms in sequential computations generally carries over to cases where arithmetic parallelism is exploited.