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: QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible and the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy.
Abstract: The discrete Fourier transform (DFT) is the base of modern signal processing 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O (N log N) and O (N2 log N) respectively Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm DFT has two properties One property is that DFT is energy conservation transform The other property is that many DFT coefficients are close to zero The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper The quantum algorithm for convolution estimation is also presented in this paper Compared with FFT, ID and 2D QDFT have time complexity O(√N) and O (N) respectively QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible
7 citations
TL;DR: An extendible look-up table of the twiddle factors for implementation of fast Fourier transform (FFT) is introduced and the results indicate that the FFT scheme is effective.
7 citations
TL;DR: The main focus of this paper is to design IFFT and FFT blocks which are used in transmitter and receiver blocks of OFDM system and the methodology used is the 8-point I FFT/FFT (DIF) with radix-2.
Abstract: OFDM is the most promising modulation technique for most of the wireless and wired communication standards. The basic idea of OFDM is to divide the available spectrum into several sub channels, making all sub channels narrowband which experiences flat fading. OFDM uses the spectrum efficiently due to its orthogonality and prevents interference between the closely spaced carriers. OFDM provides high bandwidth efficiency because the carriers are orthogonal to each others and multiple carriers share the data among themselves. The main advantage of this transmission technique is their robustness to channel fading in wireless communication environment. The main focus of this paper is to design IFFT and FFT blocks which are used in transmitter and receiver blocks of OFDM system. The methodology used is the 8-point IFFT/FFT (DIF) with radix-2. The design unit also consists of spreader and despreader for mapping technique. The implementation is done in FPGA by using Verilog HDL. The timing simulation and synthesized results are performed and the design is analyzed by using Xilinx ISE tools.
7 citations
Patent•
15 Aug 2011
TL;DR: In this paper, an efficient way of designing FFT circuits using folding transformation and register minimization techniques is proposed, which takes advantage of under utilized hardware in the serial architecture to derive L-parallel architectures without increasing the hardware complexity.
Abstract: The present invention relates to the design and implementation of parallel pipelined circuits for the fast Fourier transform (FFT). In this invention, an efficient way of designing FFT circuits using folding transformation and register minimization techniques is proposed. Based on the proposed scheme, novel parallel-pipelined architectures for the computation of complex fast Fourier transform are derived. The proposed architecture takes advantage of under utilized hardware in the serial architecture to derive L-parallel architectures without increasing the hardware complexity by a factor of L. The proposed circuits process L consecutive samples from a single-channel signal in parallel. The operating frequency of the proposed architecture can be decreased which in turn reduces the power consumption. The proposed scheme is general and suitable for applications such as communications, biomedical monitoring systems, and high speed OFDM systems.
7 citations
TL;DR: The Fast Fourier Transform (FFT) for a step-like bounded function with unequal values at boundaries may be computed by using a convenient decomposition of the total curve into two elementary ones, one of them being a linear ramp as discussed by the authors.
Abstract: The calculation of the fast fourier transform (FFT) for a step-like bounded function with unequal values at boundaries may be performed by using a convenient decomposition of the total curve into two elementary ones, one of them being a linear ramp. The method may be generalized to functions having asymptotic tails which may be approximated by simple analytic functions, the theoretical FFT of which is known.
7 citations