NDLTD logo NDLTD Union Catalog and Global ETD Search

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 1480 for “"fourier transform"”.

  1. Imaging Fourier transform spectroscopy from a space based platform : the Herschel/SPIRE Fourier transform spectrometer

    Spencer, Locke Dean, University of Lethbridge. Faculty of Arts and Science2009

    lethbridge

  2. The Fourier Transform and Some Applications

    Zion, Christopher

    <p>none</p>

    wku-diss Repository record

  3. The sparse fourier transform : theory & practice

    Al-Hassanieh, Haitham (Haitham Zuhair)Massachusetts Institute of Technology2016

    The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread …

    mit Repository record

  4. Optimizing a parallel fast Fourier transform

    Hu, Richard, 1982-Massachusetts Institute of Technology2004

    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

  5. Fast Fourier transform square wave voltammetry

    Binkley, David P.Virginia Polytechnic Institute and State University1979

    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

  6. Multidimensional random sampling for Fourier transform estimation

    Al-Ani, M.University of Westminster2013

    This research considers the Fourier transform calculations of multidimensional signals. The calculations are based on random sampling, where the sampling points are nonuniformly distributed according to strategically selected probability functions, to provide new opportunities that are unavailable …

    westminster Repository record

  7. Fourier transform infrared difference spectroscopy of bacteriorhodopsin

    Dollinger, Gavin David2011

    We have used the technique of Fourier transform infrared difference spectroscopy to study the photocycle and proton pump of bacteriorhodopsin (bR). By applying this method to the study of native bR and bR with modified chromophores, we have confirmed and extended the earlier resonance Raman results …

    uiuc Repository record

  8. The quantum Fourier transform and quantum chaos

    Weinstein, Yaakov Shmuel, 1974-Massachusetts Institute of Technology2003

    … The centerpiece of this work is the quantum Fourier transform (QFT), an essential gate for quantum algorithms and quantum simulations. Experiments are performed on a three qubit liquid-state nuclear magnetic resonance quantum information processor, and demonstrate salient features of the QFT …

    mit Repository record

  9. Fast Fourier transform on a 3D FPGA

    Basha, Elizabeth (Elizabeth Ann)Massachusetts Institute of Technology2005

    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

  10. Multiple and Extended References in Fourier Transform Holography

    Könnecke, René2010

    Die Fourier Transformations Holographie (FTH) im Bereich der weichen Röntgenstrahlung hat sich vor allem durch die Einführung Freier Elektronenlaser (FEL) zu einem schnell wachsenden Forschungsgebiet entwickelt. In der klassischen FTH mit einem einzelnen Punktloch als Referenz sind Untersuchungen …

    tu-berlin Repository record

  11. Computing the fast Fourier transform on SIMD microprocessors

    Blake, Anthony MartinUniversity of Waikato2012

    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

  12. High performance sparse Fast Fourier Transform using OpenACC

    Sinha, ArnovUniversity of Delaware2017

    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

  13. Wavelets for approximate Fourier transform and data compression

    Guo, HaitaoRice University1997

    … we develop a wavelet-based fast approximate Fourier transform algorithm. The second part is devoted to the developments of several wavelet-based data compression techniques for image and seismic data. We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute …

    rice Repository record

  14. Applications of the fourier transform to convex geometry

    Yaskin, Vladyslav, 1974-University of Missouri--Columbia2006

    … and Geometric Functional Analysis using tools of Fourier Analysis. In chapters two through four we consider the Busemann-Petty problem and its different modifications and generalizations. We solve the Busemann-Petty problem in hyperbolic and spherical spaces, and the lower dimensional …

    missouri Repository record

  15. The Hybrid Architecture Parallel Fast Fourier Transform (HAPFFT)

    Palmer, Joseph M.2005

    The FFT is an efficient algorithm for computing the DFT. It drastically reduces the cost of implementing the DFT on digital computing systems. Nevertheless, the FFT is still computationally intensive, and continued technological advances of computers demand larger and faster implementations of this …

    byu Repository record

  16. A low-cost pulsed Fourier transform network analyzer.

    Herrera, Brandon J., 1986-Baylor University.2011

    … documents the development a low-cost pulsed Fourier transform network analyzer which can be used to measure the electrical properties of materials. New silicon-germanium integrated circuits allow for the pulse system to be implemented for under $300.

    baylor Repository record

  17. Fourier Transform Nmr in Liquids at High Pressure

    Wilbur, David JamesUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-10T23:02:13Z (GMT). No. of bitstreams: 1 7511603.pdf: 4188365 bytes, checksum: f3a17495c85c5e077aa60d429cd1ce60 (MD5) Previous issue date: 1974

    uiuc Repository record

  18. Projection of acoustic fields using the Fourier transform

    Yudelman, ErrolDepartment of Electrical Engineering1985

    … for projecting acoustic fields using the Fourier transform. It is shown that the source velocity distribution can be represented by a number of sinusoids. Each sinusoid gives rise to a plane wave whose direction is given by the wavelength of the sinusoid. The plane waves are summed at the …

    cape-town Repository record

  19. An ℓ-adic Fourier transform over local fields

    Ramero, LorenzoMassachusetts Institute of Technology1994

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.

    mit Repository record

  20. Matrix probing, skeleton decompositions, and sparse Fourier transform

    Chiu, JiaweiMassachusetts Institute of Technology2013

    … low rank approximations and perform the Fast Fourier Transform. Matrix probing and its conditioning When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B1,... , Bp, we can apply A to a random vector and solve a linear system to recover this …

    mit Repository record

Page 1 of 74