Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 943 for “"Fast Fourier transform"”.
-
Nonequispaced Fast Fourier Transform
Two algorithms for fast and accurate evaluation of high degree trigonometric polynomials at many scattered points are presented. Both methods rely on highly localized kernels and the Fast Fourier Transform. The first algorithm uses the function values at uniformly distributed grid points and …
-
Modular pipeline fast Fourier transform algorithm
… pipeline architecture for computing discrete Fourier transforms (DFT) is demonstrated. For an N point DFT, two conventional pipeline √ N point fast Fourier transform (FFT) modules are joined by a specialized center element. The center element contains memories, multipliers and control logic. …
-
Switch-based Fast Fourier Transform processor
… has increased significantly in recent years. The Fast Fourier Transform (FFT) computation is essential to such designs. This work presents a switch-based architecture to design radix-2 FFT processors. The processor employs M processing elements, 2M memory arrays and M Read Only Memories (ROMs). …
-
Fast Fourier Transform Algorithms with Applications
… back into a polynomial. Engineers define the 'Fast Fourier Transform' as a method of solving the interpolation problem where the coefficient ring used to construct the polynomials has a special multiplicative structure. Mathematicians define the 'Fast Fourier Transform' as a method of solving …
-
Fast Fourier Transform and Fast Multipole
… of using two well known mathemati- cal methods, Fast Fourier Transform and Fast Multipole Methods, in speeding up N-body simulation problems. Fast Fourier Transform (FFT), a faster version of Discrete Fourier Transform, is an exact algebraic method which results in the exact solution by doing …
-
Fast Fourier transform square wave voltammetry
Fast Fourier transforms are introduced as a.unique digital data handling tool for square wave voltammetry. Theoretical square wave voltammogra.ms were examined to study the effect of experimental parameters in the spatial frequency domain. A new method was developed to determine truncation …
-
Parallel Processing of the Fast Fourier Transform
… upon the prime factor theory. It is typically faster than the Cooley-Tukey Algorithm, if the computer system has no multiplication instructions. According to the book prepared by the Digital Signal Processing Committee of the IEEE in 1979, the speed difference among these FFT algorithms is …
-
Removing Redundancies of Fast Fourier Transform Computations
The Fast Fourier Transform (FFT) is widely used in various digital signal processing (DSP) applications. In this thesis, we are exploring this problem from a fundamental arithmetic stance: maintain the degree of freedom at all stages to be the minimum by completely eliminating arithmetic …
-
Fast Fourier Transform using compiler auto-vectorization
The purpose of this thesis is to develop a fast Fourier transformation algorithm written in C with the use of GCC (GNU Compiler Collection) auto-vectorization in the multiplicative group of integers modulo n, where n is a word sized odd integer. The specific Fourier transform algorithm employed is …
-
Transfer function estimation using the Fast Fourier Transform.
… output data. The method employed utilizes the Fast Fourier Transform Algorithm and Least Squares Estimation to obtain the coefficients of the system's transfer function. The procedure has been modeled in FORTRAN IV on an IBM-360 computer. The results of simulation show the feasibility of …
-
Computing the fast Fourier transform on SIMD microprocessors
This thesis describes how to compute the fast Fourier transform (FFT) of a power-of-two length signal on single-instruction, multiple-data (SIMD) microprocessors faster than or very close to the speed of state of the art libraries such as FFTW (“Fastest Fourier Transform in the West”), SPIRAL and …
-
Bulk synchronous implementation of the fast fourier transform
Master of Science (M.S.)
-
A method of computing the fast Fourier transform
The fast Fourier transform is investigated. It is proved that the number of real (as opposed to complex) multiplications necessary to implement the algorithm M for complex input sequence of length N = 2 is 2N(M -7/2) + 12. Methods which do not avoid the unnecessary multiplications predict 2N(M-1) …
-
The Hybrid Architecture Parallel Fast Fourier Transform (HAPFFT)
… advances of computers demand larger and faster implementations of this algorithm. Past attempts at producing high-performance, and small FFT implementations, have focused on custom hardware (ASICs and FPGAs). Ultimately, the most efficient have been single-chipped, streaming I/O, …
-
Transputers and Their Use in Fast Fourier Transform Realizations
… language. Transputer realizations of pipelined Fast Fourier Transform (FFT) machines are developed.
-
Explanation of the Fast Fourier Transform and Some Applications
This report describes the Fast Fourier Transform and some of its applications. It describes the continuous Fourier transform and some of its properties. Finally, it describes the Fast Fourier Transform and its applications to hurricane risk analysis, ocean wave analysis, and hydrology.
-
Parameterized Spectral Bathymetric Roughness Using the Nonequispaced Fast Fourier Transform
… spectrum calculated with the nonequispaced fast Fourier transform (Kunis, 2006) is exploited as the statistic to provide several parameters of roughness following the method of Fox (1996). When an area is uniformly rough, it is termed isotropically rough. When an area exhibits lineation …
Page 1 of 48