Topic
Split-radix FFT algorithm
About: Split-radix FFT algorithm is a research topic. Over the lifetime, 1845 publications have been published within this topic receiving 41398 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: Two methods, based on signal processing techniques, are presented for obtaining numerical solutions for the general single server queue with first-come, first-served discipline based on the use of the fast Fourier transform.
Abstract: Two methods, based on signal processing techniques, are presented for obtaining numerical solutions for the general single server queue with first-come, first-served discipline The first method is based on the use of the fast Fourier transform (FFT) for producing iterative solutions to a discrete version of Lindley's integral equation for both nonsteady state and equilibrium conditions The second method makes use of the complex cepstrum, implemented with the FFT, for providing direct solutions with the queue in equilibrium
67 citations
••
01 May 2001TL;DR: An enhanced FFT-based parametric (E-FFT) algorithm suitable for on-line harmonic analysis of electrical power systems is presented, able to provide simultaneous tracking of co-variations between integer and non-integer (sub) harmonics in a small number of iteration steps.
Abstract: An enhanced FFT-based parametric (E-FFT) algorithm suitable for on-line harmonic analysis of electrical power systems is presented. This E-FFT algorithm exploits its iteration loops in combination with the characteristic of steep-descent gradient search strategy, to limit the sensitiveness of the total harmonic distortion caused by changes in the number of parameters involved in distorted signal models. The E-FFT algorithm performs reasonably well with short data record length. Unlike most gradient-descent search algorithms for a global minimum point, the proposed E-FFT algorithm averts the risk of being trapped at any local minimum point in the search path. The E-FFT algorithm differs from other FFT and Kalman filter based tracking algorithms, in that it is able to provide simultaneous tracking of co-variations between integer and non-integer (sub) harmonics in a small number of iteration steps. Numerical illustrative examples demonstrating the operation of this E-FFT algorithm and its simulated performance results are also presented.
65 citations
••
TL;DR: Fast Fourier transform (FFT) algorithm can be introduced into the calculation of convolution format of gyrator transform in the discrete case by using convolution operation.
65 citations
••
TL;DR: A novel modified radix-25 FFT algorithm that reduces the hardware complexity is proposed, which can reduce the number of complex multiplications and the size of the twiddle factor memory.
Abstract: This paper presents a high-speed low-complexity modified radix-25 512-point fast Fourier transform (FFT) processor using an eight data-path pipelined approach for high rate wireless personal area network applications. A novel modified radix-25 FFT algorithm that reduces the hardware complexity is proposed. This method can reduce the number of complex multiplications and the size of the twiddle factor memory. It also uses a complex constant multiplier instead of a complex Booth multiplier. The proposed FFT processor achieves a signal-to-quantization noise ratio of 35 dB at 12 bit internal word length. The proposed processor has been designed and implemented using 90-nm CMOS technology with a supply voltage of 1.2 V. The results demonstrate that the total gate count of the proposed FFT processor is 290 K. Furthermore, the highest throughput rate is up to 2.5 GS/s at 310 MHz while requiring much less hardware complexity.
63 citations
••
IBM1
TL;DR: The volumetric FFT outperforms a port of the FFTW Version 2.1.5 library on large-node-count partitions and compared with that of the Fastest Fourier Transform in the West (FFTW) library.
Abstract: This paper presents results on a communications-intensive kernel, the three-dimensional fast Fourier transform (3D FFT), running on the 2,048-node Blue Gene®/L (BG/L) prototype. Two implementations of the volumetric FFT algorithm were characterized, one built on the Message Passing Interface library and another built on an active packet Application Program Interface supported by the hardware bring-up environment, the BG/L advanced diagnostics environment. Preliminary performance experiments on the BG/L prototype indicate that both of our implementations scale well up to 1,024 nodes for 3D FFTs of size 128 × 128 × 128. The performance of the volumetric FFT is also compared with that of the Fastest Fourier Transform in the West (FFTW) library. In general, the volumetric FFT outperforms a port of the FFTW Version 2.1.5 library on large-node-count partitions.
61 citations