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 99 for “"Fast Fourier Transforms"”.

  1. Fast Fourier transforms for constrained data

    … new algorithms for computing the discrete Fourier transform (DFT). The work describes algorithms for which a set of constraints on the input or the output allow the DFT to be computed more efficiently than the standard fast Fourier transform (FFT) algorithms. The thesis reviews the Cooley …

    rice Repository record for Fast Fourier transforms for constrained data (opens in a new tab)

  2. Fast Fourier Transforms on Distributed Memory Parallel Machines

    … such algorithms to compute the Discrete Fourier Transform (DFT) of real and complex data. The implementations given in this dissertation work for a class of data distributions commonly encountered in scientific applications, known as the block scattered data distributions. The …

    odu Repository record for Fast Fourier Transforms on Distributed Memory Parallel Machines (opens in a new tab)

  3. Fast Fourier Transforms : an analysis tool for share selection

    … to stock market applications seems to be the Fourier Transform. Fourier Transforms were originally developed as an engineering tool to study repetitious (cyclical) phenomena. The benefit of Fourier Transform is its ability to extract the predominate cycle(s) from a series of data, in this …

    nwu-za Repository record for Fast Fourier Transforms : an analysis tool for share selection (opens in a new tab)

  4. Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods

    … provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, …

    qucosa-diss

  5. The applicability of special purpose computers to fast Fourier transforms.

    The Fast Fourier Transfonn is an algorithm for the computation of Discrete Fourier Transforms in less time than allowed by any other algorithm available. The use of special purpose digital machines to reduce those times even further is of interest for real time spectral analysis. The main …

    nps Repository record for The applicability of special purpose computers to fast Fourier transforms. (opens in a new tab)

  6. Multi-objective genetic algorithms for computing fast fourier transforms over wireless sensor networks

    … associated with the computation of Fast Fourier Transform during signal processing at the node level. Another novel technique achieved by this research is the design of Stochastic Context-aware energy consumption and distribution model capable of resolving the problem of load …

    nwu-za Repository record for Multi-objective genetic algorithms for computing fast fourier transforms over wireless sensor networks (opens in a new tab)

  7. Tropospheric Spectrum Estimations Comparing Maximum Likelihood with Expectation Maximization Solutions and Fast Fourier Transforms

    … technologies needed in the design of new imaging Fourier transform spectrometers (IFTS). The IIP IFTS was developed at the Space Dynamics Laboratory and flown to an altitude of 103,000 feet on an instrumented NASA balloon payload. The sensor collected approximately 15,000 interferograms during its …

    utahstate Repository record for Tropospheric Spectrum Estimations Comparing Maximum Likelihood with Expectation Maximization Solutions and Fast Fourier Transforms (opens in a new tab)

  8. Efficient Computation of Electrostatic Interactions in Particle Systems Based on Nonequispaced Fast Fourier Transforms

    … the well-known Ewald summation approach and the fast Fourier transform (FFT). Typically, such methods are able to handle systems of point charges subject to periodic boundary conditions in all spatial directions. However, periodicity is not always desired in all three dimensions and, moreover, …

    qucosa-diss

  9. Parallel processor architecture for a digital beacon receiver

    … using digital signal processing techniques. Fast Fourier transforms are used to locate the carrier within 0.5 Hz. The outputs of the receiver include the frequency and the power of the carrier.

    vt Repository record for Parallel processor architecture for a digital beacon receiver (opens in a new tab)

  10. Computational Approaches to Silicon-Based Nanostructures

    … the solution of Schrodinger's equation based on Fast Fourier Transforms is described. Using this simulation method, it becomes possible to solve Schrodinger's equation in the one band approximation for arbitrary band structures, putting a more complete description of high energy states and …

    uiuc Repository record for Computational Approaches to Silicon-Based Nanostructures (opens in a new tab)

  11. Factored-matrix representation of distributed fast transforms

    Parallel implementations of Fast Fourier Transforms (FFTs) and other Fast transforms are represented using factored, partitioned matrices. the factored matrix description of a distributed FFT is introduced using a decimation-in-time (DIT) FFT algorithm suitable for implementation on a distributed …

    nps Repository record for Factored-matrix representation of distributed fast transforms (opens in a new tab)

  12. A study of modal-space control of a beam-cable structure: experiment and theory

    … and theoretical response on the basis of Fast Fourier Transforms of transient time data.

    vt Repository record for A study of modal-space control of a beam-cable structure: experiment and theory (opens in a new tab)

  13. Design of Efficient Algorithms Through Minimization of Data Transfers

    … and r-register implementations of Hadamard and Fast Fourier Transforms using various computational kernels are studied for their code sizes and time complexities. The results obtained also allow one to select an optimal hardware devoted to a particular computational application

    odu Repository record for Design of Efficient Algorithms Through Minimization of Data Transfers (opens in a new tab)

  14. 3D MRI reconstruction on golden-angle linogram domains

    … combined with three-dimensional non-uniform fast Fourier transforms. In this work we propose the Golden-Angle Full-spoke Linogram Fourier Domain in 3D (GAFLiD3) and Golden-Angle Half-spoke Linogram Fourier Domain in 3D (GAHLiD3), analogous linogram-based domains with lower computational image …

    brazil-ufrn Repository record for 3D MRI reconstruction on golden-angle linogram domains (opens in a new tab)

  15. Tip clearance and angle of attack effects upon the unsteady response of a vibrating flat plate in crossflow

    … simulating the flISt bending mode. Averaged Fast Fourier Transforms were used to determine pressure oscillation amplitudes and phase lags with respect to the plate motion.

    vt Repository record for Tip clearance and angle of attack effects upon the unsteady response of a vibrating flat plate in crossflow (opens in a new tab)

  16. Z-transform Analysis of Zero-Crossing Speech

    … definition this is the magnitude of the discrete Fourier transform, which can be evaluated easily with the fast Fourier transforms available. The success of this FFT analysis led to the development and testing of an FFT based zero-crossing segment vocoder. The test results of the polynomial format …

    marquette Repository record for Z-transform Analysis of Zero-Crossing Speech (opens in a new tab)

  17. Digital Signal Processing Capabilities of the Fujitsu MB8764

    … considered. The MB8764 capabilities in computing fast Fourier transforms are discussed. Development of a working digital filter with the MB8764 work station is presented.

    ucf Repository record for Digital Signal Processing Capabilities of the Fujitsu MB8764 (opens in a new tab)

  18. LAMINAR TURBULENT TRANSITION - SPECTRAL ANALYSIS AND COHERENT STRUCTURES OF DNS WAVEPACKETS

    … and amplitude on the transition process. Fast Fourier transforms (FFT) are then performed to extract the one, two and three-dimensional (3D) spatio-temporal spectra of the flow. In particular, the three-dimensional spectrum yields new information about modes that overlap ambiguously in …

    nus Repository record for LAMINAR TURBULENT TRANSITION - SPECTRAL ANALYSIS AND COHERENT STRUCTURES OF DNS WAVEPACKETS (opens in a new tab) Download file for LAMINAR TURBULENT TRANSITION - SPECTRAL ANALYSIS AND COHERENT STRUCTURES OF DNS WAVEPACKETS (opens in a new tab)

Page 1 of 5