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
07 Jun 1982
TL;DR: This paper analyzes in detail how far the proposed Single Instruction Multiple Data computers with interconnection networks are applicable in the signal processing area and shows that the latter gives much higher speedup for P > 16 and is more cost-effective even with the high cost of switches.
Abstract: This paper analyzes in detail how far the proposed Single Instruction Multiple Data (SIMD) computers with interconnection networks are applicable in the signal processing area. Decimation in the time radix-2 fast Fourier transform (FFT) algorithm is considered here for implementation in a multiprocessor system with shared bus and an SIMD computer with interconnection network.Results are derived for data allocation, interprocessor communication, approximate computation time, speedup, and cost effectiveness for an N-point FFT with any P available processors. Further generalization is obtained for a radix-r FFT algorithm. N X N point, two-dimensional discrete Fourier transform (DFT) implementation is also considered, with one or more rows of input matrix allocated to each processor.Various curves are plotted and a comparison in performance is carried out between a shared-bus multiprocessor and SIMD computer with interconnection network. It is shown that the latter gives much higher speedup for P > 16 and is more cost-effective even with the high cost of switches. N, P and r, considered here, are all powers of 2.
4 citations
01 Dec 1996
TL;DR: A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution in real-time applications that uses the moving discrete Hartley transform to compute the Hilbert transform and implements the PDWVD in real domain.
Abstract: A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution (PDWVD) in real-time applications. The proposed algorithm uses the moving discrete Hartley transform to compute the Hilbert transform and thereby implements the PDWVD in real domain. The computational complexity of the proposed algorithm is derived and compared with the existing algorithm to compute the PDWVD.
4 citations
01 Apr 1985
TL;DR: A new Hankel transform algorithm designed for uniformly sampled data is presented, which is the most elementary of several algorithms derived from the Tchebycheff and Fourier transforms.
Abstract: A new Hankel transform algorithm designed for uniformly sampled data is presented. Although data of this type occur frequently, previous algorithms require interpolations and/or numerical evaluations of Bessel functions. These difficulties can be avoided by using a Tchebycheff transform followed by a Fourier transform. The basic structure and performance of any Hankel transform algorithm derived from this two-step process depends on the combined results from the numerical methods used to compute the Tchebycheff and Fourier transforms. The algorithm presented here is the most elementary of several algorithms derived from this procedure. Examples are presented and errors associated with the results are discussed.
4 citations
TL;DR: In this article, a subband Hilbert transform based on subband decomposition is proposed for analytic signal processing in single-sideband amplitude modulation and demodulating frequency-modulated signals.
Abstract: A new and fast approximate Hilbert transform based on subband decomposition is presented. This new algorithm is called the subband (SB)-Hilbert transform. The reduction in complexity is obtained for narrow-band signal applications by considering only the band of most energy. Different properties of the SB-Hilbert transform are discussed with simulation examples. The new algorithm is compared with the full band Hilbert transform in terms of complexity and accuracy. The aliasing errors taking place in the algorithm are found by applying the Hilbert transform to the inverse FFT (time signal) of the aliasing errors of the SB-FFT of the input signal. Different examples are given to find the analytic signal using SB-Hilbert transform with a varying number of subbands. Applications of the new algorithm are given in single-sideband amplitude modulation and in demodulating frequency-modulated signals in communication systems. Key Words : Fast Algorithms, Hilbert Transform, Analytic Signal Processing.
4 citations
01 Nov 2010
TL;DR: The feasibility of the two-dimension algorithm is proved by its successful application in the domain of digital watermarking and its sensitivity to attacks in both the spatial domain and the frequency domain indicates that the algorithm can be applied to make fragile watermarkings.
Abstract: In order to improve the computing efficiency and accuracy of Discrete Fractional Fourier Transform (DFRFT), a fast algorithm derived from Fast Fourier Transform is introduced on the basis of the study on the periodicity of the eigenvalues of Fractional Fourier Transform (FRFT). Moreover, the algorithm is generalized to implement the two-dimension DFRFT, by which the fractional order spectrum of the digital images can be obtained. In addition, the feasibility of the two-dimension algorithm is proved by its successful application in the domain of digital watermarking. Finally, the properties of the FRFT watermarking are briefly discussed: its sensitivity to attacks in both the spatial domain and the frequency domain indicates that the algorithm can be applied to make fragile watermarkings.
4 citations