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 242 for “"Fast Fourier Transform"”.

  1. Optimizing a parallel fast Fourier transform

    Parallel computing, especially cluster computing has become more popular and more powerful in recent years. Star-P is a means of harnessing that power by eliminating the difficulties in parallelizing code and by providing the user with a familiar and intuitive interface. This paper presents methods …

    mit Repository record for Optimizing a parallel fast Fourier transform (opens in a new tab)

  2. 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 …

    vt Repository record for Fast Fourier transform square wave voltammetry (opens in a new tab)

  3. Fast Fourier transform on a 3D FPGA

    Fast Fourier Transforms perform a vital role in many applications from astronomy to cellphones. The complexity of these algorithms results from the many computational steps, including multiplications, they require and, as such, many researchers focus on implementing better FFT systems. However, all …

    mit Repository record for Fast Fourier transform on a 3D FPGA (opens in a new tab)

  4. 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 …

    waikato-masters Repository record for Computing the fast Fourier transform on SIMD microprocessors (opens in a new tab)

  5. High performance sparse Fast Fourier Transform using OpenACC

    The Sparse Fast Fourier Transform (sFFT) 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 sFFT can be faster than modern FFT libraries for …

    udel Repository record for High performance sparse Fast Fourier Transform using OpenACC (opens in a new tab)

  6. 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, …

    byu Repository record for The Hybrid Architecture Parallel Fast Fourier Transform (HAPFFT) (opens in a new tab)

  7. Digital signal processing hardware for a fast fourier transform radio telescope

    … very large numbers of antennas. The Omniscope, a Fast Fourier Transform telescope, is exactly such a telescope. I detail the implementation of the digital signal processing backend of a 32-channel interferometer designed to help characterize the non-digital parts of the system, starting at the …

    mit Repository record for Digital signal processing hardware for a fast fourier transform radio telescope (opens in a new tab)

  8. An efficient multivariate multidimensional random field generator using the fast Fourier transform

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1994.

    mit Repository record for An efficient multivariate multidimensional random field generator using the fast Fourier transform (opens in a new tab)

  9. Implementation of a 2-D fast Fourier transform on an FPGA-based computing platform

    The two dimensional fast Fourier transform (FFT) is a useful operation in many digital signal processing applications, but it is often avoided due to its large computational requirements. This thesis presents the implementation and performance figures for the fast Fourier transform on an FPGA-based …

    vt Repository record for Implementation of a 2-D fast Fourier transform on an FPGA-based computing platform (opens in a new tab)

  10. IMPLEMENTATION OF A NOVEL INTEGRATED DISTRIBUTED ARITHMETIC AND COMPLEX BINARY NUMBER SYSTEM IN FAST FOURIER TRANSFORM ALGORITHM

    … of any dedicated multiplier for calculating the fast Fourier transform algorithm (FFT), using the Distributed Arithmetic (DA) technique and Complex Binary Number Systems (CBNS). The FFT algorithm is one of the most used and implemented technique employed in many Digital Signal Processing (DSP) …

    siu-theses Repository record for IMPLEMENTATION OF A NOVEL INTEGRATED DISTRIBUTED ARITHMETIC AND COMPLEX BINARY NUMBER SYSTEM IN FAST FOURIER TRANSFORM ALGORITHM (opens in a new tab)

  11. A comparison of the least squares collocation and the fast Fourier transform methods for gravimetric geoid determination

    … of the least squares collocation (LSC) and the fast Fourier transform (FFT) techniques for gravimetric geoid computation. The Land Levelling Datum (LLD) is the South African vertical datum based on more than 100 years old tide gauge measurements of mean sea level (MSL). The LLD is poorly defined …

    cape-town Repository record for A comparison of the least squares collocation and the fast Fourier transform methods for gravimetric geoid determination (opens in a new tab)

  12. The Design, Simulation and Synthesis of Pipelined Floating-Point Radix-4 Fast Fourier Transform Data Path in VHDL

    The Fast Fourier Transform (FFT) converts time or spatial information into the frequency domain. The FFT is one of the most widely used digital signal processing (DSP) algorithms. DSPs are used in a number of applications from communication and controls to speech and image processing. DSPs have …

    temple Repository record for The Design, Simulation and Synthesis of Pipelined Floating-Point Radix-4 Fast Fourier Transform Data Path in VHDL (opens in a new tab)

  13. Methods of fast Fourier transform in diffraction problems of elastic and acoustic waves with applications to crack mechanics

    … is connected with a development of modern fast computational methods applied to problems in wave dynamics, acoustics, and boundary-value problems of mechanics with mixed boundary conditions. This includes: 1) Development of fast methods for integral equations with convolution kernels …

    catania Repository record for Methods of fast Fourier transform in diffraction problems of elastic and acoustic waves with applications to crack mechanics (opens in a new tab)

  14. On the realisation of sequential fast fourier transform for orthogonal frequency division multiplexing based on field programmable gate array

    … widely used in many applications is the Fourier Transform, in both the standard Discrete Fourier Transform (DFT) and the Fast Fourier Transform (FFT) implementation. The DFT and FFT are widely used for many applications such as spectral analysis, but in modern mobile and wireless …

    strathclyde Repository record for On the realisation of sequential fast fourier transform for orthogonal frequency division multiplexing based on field programmable gate array (opens in a new tab)

Page 1 of 13