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 27 for “"Discrete Fourier transforms"”.

  1. Simplified six-point discrete Fourier transforms

    … were developed to implement a six-point discrete Fourier transform (DFT) method. The DFT was then used to calculate a related quantity,. the power spectral density (PSD). A recursive implementation of a time domain Banning window was derived to minimize side-lobe leakage.</p> <p>Five …

    ut-knoxville Repository record for Simplified six-point discrete Fourier transforms (opens in a new tab)

  2. Crystal plasticity finite element simulations using discrete Fourier transforms

    Crystallographic texture and its evolution are known to be major sources of anisotropy in polycrystalline metals. Highly simplified phenomenological models cannot usually provide reliable predictions of the materials anisotropy under complex deformation paths, and lack the fidelity needed to …

    gatech Repository record for Crystal plasticity finite element simulations using discrete Fourier transforms (opens in a new tab)

  3. Methods for performing discrete fourier transforms on the TSM32020 microprocessor

    <p>Computation of the discrete Fourier transform (DFT) with a general purpose microprocessor offers the usual advantages of these chips. They are programmable, small, inexpensive, and use little power. However, DFT computation speed is not as great as could be obtained with an architecture more …

    ut-knoxville Repository record for Methods for performing discrete fourier transforms on the TSM32020 microprocessor (opens in a new tab)

  4. Effect of Non-Ideal Sampling on the Discrete Fourier Transforms of an Object Function

    Fourier Series and Fourier Transforms can be used to determine the frequency content of a continuous signal. This paper investigates the situation where a two dimensional object function is sampled by a detector array of a finite size. Continuous Fourier analysis is not applicable to sampled data, …

    ucf Repository record for Effect of Non-Ideal Sampling on the Discrete Fourier Transforms of an Object Function (opens in a new tab)

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

    rice Repository record for A method of computing the fast Fourier transform (opens in a new tab)

  7. Application of holographic interferometry to supersonic flow visualization of a rearfacing step and application of fast Fourier transform methods to current data reduction techniques.

    … interferograms of the flow were created. Fast Fourier Transform (FFT) methods have been reported as significantly reducing computational time to obtain discrete and inverse discrete Fourier transforms. Two computer programs were designed to apply FFT methods to the Fourier transform approach to …

    nps Repository record for Application of holographic interferometry to supersonic flow visualization of a rearfacing step and application of fast Fourier transform methods to current data reduction techniques. (opens in a new tab)

  8. VLSI systolic array architectures for the one-dimensional and two-dimensional discrete Fourier transform.

    … array architectures for the 1-D and the 2-D discrete Fourier transforms (DFT) using the second-order Goertzel algorithm. For the 1-D DFT, two 1-D and one 2D systolic arrays are proposed. The two 1-D structures, a semi-systolic array and a pure-systolic array, are characterized by regular, …

    ottawa-retro Repository record for VLSI systolic array architectures for the one-dimensional and two-dimensional discrete Fourier transform. (opens in a new tab)

  9. Fourier methods for numerical solution of FBSDEs with applications in mathematical finance

    We present a Fourier analysis approach to numerical solution of forward-backward stochastic differential equations (FBSDEs) and propose two implementations. Using the Euler time discretization for backward stochastic differential equations (BSDEs), Fourier analysis allows to express the conditional …

    concordia Download PDF for Fourier methods for numerical solution of FBSDEs with applications in mathematical finance (opens in a new tab)

  10. Development of a Model and Imbalance Detection System for the Cal Poly Wind Turbine

    … shifts, lock-in amplifiers, phase-locked loops, discrete Fourier transforms, and decimation filters. The processed data is fed into an algorithm that determines if there is an imbalance. The detection algorithm consists of a machine learning classification model that uses experimental data to …

    calpoly Repository record for Development of a Model and Imbalance Detection System for the Cal Poly Wind Turbine (opens in a new tab)

  11. IED pattern recognition using sinusoidal models

    … non-linear optimization of a sine function, and discrete Fourier transforms (DFT). Non-linear optimization and DFT models both out-perform a mean inter-arrival model when applied to representative IED patterns. We also applied these models against portions of an Iraq IED dataset using a rolling …

    nps Repository record for IED pattern recognition using sinusoidal models (opens in a new tab)

  12. The Unification and Decomposition of Processing Structures Using Lattice Theoretic Methods

    … in developing systematic methods for decomposing discrete Fourier transforms and discrete linear systems. That is, fast Fourier transforms and partial fraction expansions of linear systems are a result of the natural representation derived using the lattice theoretic method. The discrete Fourier …

    odu Repository record for The Unification and Decomposition of Processing Structures Using Lattice Theoretic Methods (opens in a new tab)

  13. SPECTRAL DATABASE AND FRAMEWORK FOR COMPUTATIONALLY EFFICIENT CRYSTAL PLASTICITY SIMULATIONS

    … developed spectral database approach based on discrete Fourier transforms (DFTs). This approach has demonstrated impressive computational advantages over the conventional approaches. Despite their wide applicability, in some applications the DFT database approach has encountered significant …

    gatech Repository record for SPECTRAL DATABASE AND FRAMEWORK FOR COMPUTATIONALLY EFFICIENT CRYSTAL PLASTICITY SIMULATIONS (opens in a new tab)

  14. Modular pipeline fast Fourier transform algorithm

    A modular 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 …

    texas Repository record for Modular pipeline fast Fourier transform algorithm (opens in a new tab) Restricted access

  15. The estimation of continuous-time systems using discrete data

    … The basic method of estimation involves the Fourier transformation of the model and the insertion of the discrete Fourier transforms to produce an approximate model that is of regression type and is thus relatively easy to handle, although the estimation must generally rely on numerical …

    anu Repository record for The estimation of continuous-time systems using discrete data (opens in a new tab)

  16. A New Spectral Method in Time Series Analysis

    … of the finite boundary of observation in the discrete Fourier transforms (DFT), which is used in the construction of the periodogram. Moreover, we show that by using the best linear predictors of the time series outside the observed domain, we can obtain the “complete periodogram" that is an …

    tamu Repository record for A New Spectral Method in Time Series Analysis (opens in a new tab)

  17. Order and Disorder in Type–II InAs/InAsSb Superlattices

    … reciprocal–space satellite peaks obtained from discrete Fourier transforms of individual STM images. Properly implemented, the technique enables local period measurements that reliably discriminate lateral fluctuations localized to within ~ 40 nm along <110> directions in the growth plane. While …

    tamu Repository record for Order and Disorder in Type–II InAs/InAsSb Superlattices (opens in a new tab)

  18. NEW METHODS OF NONLINEAR DIGITAL IMAGE RESTORATION

    … moments of the image and the spread function discrete Fourier transforms (DFT). The second method, which performs even better than the first, is a maximum likelihood estimation algorithm to find the object's DFT. The maximum likelihood algorithm uses both the first and second moments of the …

    arizona-thes Repository record for NEW METHODS OF NONLINEAR DIGITAL IMAGE RESTORATION (opens in a new tab)

  19. Bearing Load Measurement System

    … and stress, and analyzing the results through discrete Fourier transforms to understand the dynamic behavior of the bearings under load and the obtained plots and result shows that the axial strain with respect to the load increases linearly with curve fit. Hence, this work concludes that the …

    chalmers Repository record for Bearing Load Measurement System (opens in a new tab)

  20. Design of two-dimensional non-separable filters using semi-definite programming

    … literature, such as the window method, frequency transforms, and nonuniform discrete Fourier transforms. However, the difficulties of these methods lie in their inability to incorporate further constraints on the filters, such as flatness constraints. Recently, semi-definite programming (SDP) …

    unsw Repository record for Design of two-dimensional non-separable filters using semi-definite programming (opens in a new tab)

Page 1 of 2