scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: The fixed-point error analysis and parameter selections of MSR-CORDIC with applications to the fast Fourier transform (FFT) are presented and two different parameter selection algorithms are proposed for general and dedicated MSR, CORDIC structures.
Abstract: Mixed-scaling-rotation (MSR) coordinate rotation digital computer (CORDIC) is an attractive approach to synthesizing complex rotators. This paper presents the fixed-point error analysis and parameter selections of MSR-CORDIC with applications to the fast Fourier transform (FFT). First, the fixed-point mean squared error of the MSR-CORDIC is analyzed by considering both the angle approximation error and signal round-off error incurred in the finite precision arithmetic. The signal to quantization noise ratio (SQNR) of the output of the FFT synthesized using MSR-CORDIC is thereafter estimated. Based on these analyses, two different parameter selection algorithms of MSR-CORDIC are proposed for general and dedicated MSR-CORDIC structures. The proposed algorithms minimize the number of adders and word-length when the SQNR of the FFT output is constrained. Design examples show that the FFT designed by the proposed method exhibits a lower hardware complexity than existing methods.

33 citations

Journal ArticleDOI
TL;DR: A novel algorithm based on discrete Fourier transform to estimate the frequency of power system frequency that is immune to inter-harmonics as well as harmonics; it has simple and easy implementation; and it has good performance both in steady and dynamic states.
Abstract: A novel algorithm based on discrete Fourier transform (DFT) to estimate the frequency of power system is proposed. The algorithm that we called transformed discrete Fourier transform (TDFT) involves transforming consecutive points of DFT of voltage signals to reduce the leakage components. The algorithm has the following merits: It is immune to inter-harmonics as well as harmonics; it has simple and easy implementation; and it has good performance both in steady and dynamic states. What is more, it can keep high precision in a very wide frequency deviation range, for example, 40-60 Hz. Simulation experiments validate this algorithm can track power system frequency precisely.

33 citations

Proceedings ArticleDOI
03 Nov 2003
TL;DR: This paper presents an FFT approximation technique suitable for on-chip spectral BIST signal generation and analysis and shows that the noise produced by the approximation technique is under 24.74 dB for a 256 point FFT with a 32 point approximate kernel.
Abstract: Signal generation and analysis are an important part of BIST for analog and mixed-signal systems. An accurate analysis of the spectral content of signals produced by analog components can be accomplished with a digital implementation of a fast Fourier transform (FFT) algorithm. In the past, size and speed have limited the application of such a technique to off-chip test equipment or DSP chips (primarily due to the number of multiplication operations). In this paper, we present an FFT approximation technique suitable for on-chip spectral BIST signal generation and analysis. For signal generation, we show that the noise produced by the approximation technique is under 24.74 dB for a 256 point FFT with a 32 point approximate kernel. For signal analysis, we show that the instantaneous dynamic range (IDR) for the approximation technique is under 21.80 dB for a 256 point FFT with a 32 point approximate kernel. Our techniques have been implemented and demonstrated on a Xilinx Virtex-II FPGA using an off-chip ADC and DAC, and we are currently implementing the technique on an ASIC using a 0.13 /spl mu/m SiGe process for 2-16 GHz applications.

32 citations

Journal ArticleDOI
TL;DR: The implementation results show that the proposed 128‐point mixed‐radix FFT architecture significantly reduces the hardware cost and power consumption in comparison to existing 128‐ point FFT architectures.
Abstract: In this paper, we present a fast Fourier transform (FFT) processor with four parallel data paths for multiband orthogonal frequency-division multiplexing ultrawideband systems. The proposed 128-point FFT processor employs both a modified radix-2 4 algorithm and a radix-2 3 algorithm to significantly reduce the numbers of complex constant multipliers and complex booth multipliers. It also employs substructure-sharing multiplication units instead of constant multipliers to efficiently conduct multiplication operations with only addition and shift operations. The proposed FFT processor is implemented and tested using 0.18 µm CMOS technology with a supply voltage of 1.8 V. The hardware- efficient 128-point FFT processor with four data streams can support a data processing rate of up to 1 Gsample/s while consuming 112 mW. The implementation results show that the proposed 128-point mixed-radix FFT architecture significantly reduces the hardware cost and power consumption in comparison to existing 128-point FFT architectures.

32 citations

Journal ArticleDOI
TL;DR: This paper discusses the two‐dimensional implementation of a number of modified fast Fourier transform algorithms that efficiently interpolate (zoom) magnetic resonance (MR) images, and a significant reduction in computation time is achieved when modeling is combined with 2D‐BSDF and SIFFT as fewer points require modeling.
Abstract: This paper discusses the two-dimensional implementation of a number of modified fast Fourier transform (FFT) algorithms that efficiently interpolate (zoom) magnetic resonance (MR) images If the original image was sampled at a rate satisfying the Nyquist criterion, these algorithms would effectively increase the sampling rate, permitting image details to be more easily discerned The Skinner interpolating fast Fourier transform (SIFIT) avoids many of the computationally unnecessary complex multiplications that occur when interpolating using the normal fast Fourier transform algorithm The novel interpolating fast Fourier transform (NIFFT) offers further savings when a subimage is required Theoretical and experimental timings that compare the use of the normal FFT, SIFFT, and NIFFT algorithms for interpolation are given using magnetic resonance image reconstruction examples Time savings of a factor of 2 to 4 are possible in typical experimental situations Time savings of factors of 5 to 20 are possible when zooming images using two-dimensional band selectable digital filtering (2D-BSDF) in combination with decimation and the SIFFT algorithm In 2D-BSDF, the original MRI data set is reduced in size to retain only those frequency components corresponding to a desired subimage, thereby decreasing the computational load associated with further processing A significant reduction in computation time is achieved when modeling is combined with 2D-BSDF and SIFFT as fewer points require modeling © 1988 Academic Press, Inc

32 citations


Network Information
Related Topics (5)
Signal processing
73.4K papers, 983.5K citations
80% related
Filter (signal processing)
81.4K papers, 1M citations
78% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Iterative method
48.8K papers, 1.2M citations
77% related
Optimization problem
96.4K papers, 2.1M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20239
202234
20192
20188
201748
201689