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
02 Jul 2012
TL;DR: In this article, an innovative orthogonal frequency division multiplexing (OFDM) scheme based on orthogon chirped subcarriers is proposed, which can be electronically implemented with a complexity equivalent to the conventional fast Fourier transform (FFT), and the planar device that implements the FrFT in the optical domain is similar to the passive arrayed waveguide grating (AWG) device that performs the FFT.
Abstract: An innovative Orthogonal Frequency Division Multiplexing (OFDM) scheme based on orthogonal chirped subcarriers is proposed. We show that the fractional Fourier transform (FrFT) of the input signal can be electronically implemented with a complexity equivalent to the conventional fast Fourier transform (FFT); on the other hand, the planar device that implements the FrFT in the optical domain is similar to the passive arrayed waveguide grating (AWG) device that performs the FFT. We analyze the spectral efficiency, the peak-to-average power ratio (PAPR) and the frequency offset sensitivity of a FrFT-based optical OFDM system, and make an accurate comparison with the standard FFT-based implementation.
8 citations
23 Mar 2010
TL;DR: An FFT-based algorithm is proposed for the problem of string matching with mismatches, which computes an estimate with accuracy, which consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers.
Abstract: String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.
8 citations
04 May 2014
TL;DR: This paper elaborately design an accumulator that can generate accessing addresses for the operands, as well as the twiddle factors that helps the designer to efficiently choose an arbitrary FFT to design the in-place architecture.
Abstract: A mixed radix algorithm for the in-place fast Fourier transform (FFT), which is broadly used in most embedded signal processing fields, can be explicitly expressed by an iterative equation based on the Cooley-Tukey algorithm. The expression can be applied to either decimation-in-time (DIT) or decimation-in-frequency (DIF) FFTs with ordered inputs. For many newly emerging low power portable computing applications, such as mobile high definition video compressing, mobile fast and accurate satellite location, etc., the existing methods perform either resource consuming or non-flexible. In this paper, we propose a new addressing scheme for efficiently implementing mixed radix FFTs. In this scheme, we elaborately design an accumulator that can generate accessing addresses for the operands, as well as the twiddle factors. The analytical results show that the proposed scheme reduces the algorithm complexity meanwhile helps the designer to efficiently choose an arbitrary FFT to design the in-place architecture.
7 citations
19 Aug 2001
TL;DR: An efficient FFT (fast Fourier transform) algorithm for OFDM (orthogonal frequency division multiplexing) modulation, named "radix-4/2", which reduces the number of non-trivial multiplications compared to the radix-2/sup 3/ FFT algorithm, and has twice the processing rate.
Abstract: We propose an efficient FFT (fast Fourier transform) algorithm for OFDM (orthogonal frequency division multiplexing) modulation, named "radix-4/2". This algorithm, based on the radix-4 butterfly operator reduces the number of non-trivial multiplications compared to the radix-2/sup 3/ FFT algorithm, and it has twice the processing rate as the radix-2/sup 3/ FFT algorithm. With 64-point and pipeline architecture, the proposed radix-4/2 algorithm reduces the number of non-trivial multiplications to the ratio of 3 to 2 compared with the radix-4 algorithm, and it has twice the processing rate as the radix-2/sup 3/ algorithm.
7 citations
16 Oct 2010
TL;DR: The design and implementation of a fully pipelined 64-point FFT engine in programmable logic is described, capable of performing FFT operation without changing the internal coefficients which makes it highly suitable for practical applications.
Abstract: The Fast Fourier Transform (FFT) is a very important algorithm in signal processing, software defined radio and the most promising modulation technique i.e. Orthogonal Frequency Division Multiplexing (OFDM). This paper describes the design and implementation of a fully pipelined 64-point FFT engine in programmable logic. The FFT takes 16-bit fixed point complex numbers as input and after a known pipelined latency of 20 clock cycles produces the desired output. The input data samples are fed in parallel to the FFT engine to generate outputs in parallel. The architecture is capable of performing FFT operation without changing the internal coefficients which makes it highly suitable for practical applications. The architecture requires 25% multiplication operations compared to conventional Cooley-Tukey approach. Hence it leads to low power and area saving.
7 citations