In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double proces...

  In this article, vibration analysis of an Euler-Bernoulli beam resting on a Pasternak-type foundation is studied. The governing equation is solved by using a spectral finite element model (SFEM). The solution involves calculating wave and time responses of the beam. The Fast Fourier Transform function is used for temporal discretization of the governing partial differential equation into a se...

The Sparse Fast Fourier Transform is a recent algorithm developed by Hassanieh et al. at MIT for Discrete Fourier Transforms on signals with a sparse frequency domain. A reference implementation of the algorithm exists and proves that the Sparse Fast Fourier Transform can be faster than modern FFT libraries. However, the reference implementation does not take advantage of modern hardware featur...

In this paper we have here in the processor FFT and FFT butterfly structure, reading, writing and execution addresses. Fast Fourier Transform (FFT) coprocessor having a noticeable impact on the performance of communication systems, has been a hot topic of research for many years. FFT function over the complex numbers in a row, also known as butterfly units have to add and multiply. , FFT archit...

This paper proposes two low complexity methods in time domain for limiting Peak to Average Power Ratio (PAPR) in Orthogonal Frequency Division Multiplexing (OFDM) systems by employing cyclically shifted sequences with different delay and phase factors. Since the proposed method operates in time domain it requires only two Fast Fourier Transform (FFT) operations to achieve significant PAPR reduc...

In this letter, a unified hardware architecture that can be reconfigured to calculate 2, 3, 4, 5, or 7-point DFTs is presented. The architecture is based on the Winograd Fourier transform algorithm (WFTA) and the complexity is equal to a 7-point DFT in terms of adders/subtracters and multipliers plus only seven multiplexers introduced to enable reconfigurability. The processing element finds po...

In modern communication systems, Orthogonal Frequency Division Multiplexing (OFDM) systems are used to transmit with higher data rate and avoid Inter Symbol Interference (ISI). The OFDM transmitter and receiver contain Inverse Fast Fourier Transform (IFFT) and Fast Fourier Transform (FFT), respectively. The IFFT block provides orthogonality between adjacent subcarriers. The orthogonality makes ...

This paper presents a methodology for the registration of an Interferometric Synthetic Aperture radar (InSAR) pair images with a sub-pixelic precision performed in the Fourier domain, using the Fast Fourier Transform (FFT). We look for the maximum of the modulus of the cross-correlation coefficient of both images on a window dimensions of 2x2 pixels using an iterative process. This will be poss...

velocity analysis is one of the most important step in seismic data processing. it affects not only many processing steps directly and indirectly, but also is known as a primary interpretation of the data. however, it can also be assumed as one of the most time consuming processing step. the conventional velocity analysis method measures the energy amplitude along hyperbolic trajectories within...