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

  1. Basic Fourier Transforms

    … this paper is to develop some of the more basic Fourier transforms which are the outgrowth of the Fourier theorem. Although often approached from the stand-point of the series, this paper will approach the theorem from the standpoint of the integral.

    unt Repository record for Basic Fourier Transforms (opens in a new tab)

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

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

  3. Aperture compensated radon and fourier transforms

    … used to design an artifacts-reduced 2-D discrete Fourier transform. A by-product of the method is a high resolution periodogram. This periodogram coincides with the periodogram that would have been computed with a longer array of receivers if the data consist of a limited superposition of linear …

    ubc Repository record for Aperture compensated radon and fourier transforms (opens in a new tab) Download PDF for Aperture compensated radon and fourier transforms (opens in a new tab)

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

  5. From Generalized Fourier Transforms to Coupled Supersymmetry

    The Fourier transform, the quantum mechanical harmonic oscillator, and supersymmetric quantum mechanics are well-studied objects in mathematics. The relations between them are also well-understood, though the traditional understanding of each has led to a rigidity in their design. In this thesis, …

    houston Repository record for From Generalized Fourier Transforms to Coupled Supersymmetry (opens in a new tab)

  6. Laplace transform method for hypercomplex Fourier transforms

    … te definieren die gelijkenissen vertoont met de fouriertransformatie en waarvan de kern een oplossing van dit systeem is. Belangrijke eigenschappen, zoals de afleidingseigenschap, eigenfuncties en bijhorende eigenwaarden werden voor deze nieuwe soort fouriertransformaties reeds bestudeerd. Deze …

    ghent Repository record for Laplace transform method for hypercomplex Fourier transforms (opens in a new tab)

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

  8. Chirp-Based decompositions for computing fractional fourier transforms

    The fractional Fourier transform (FrFT) is a tool for analyzing non-stationary signals, associated with rotations of signal representations through energy distributions in the time-frequency plane. The main numerical algorithm for computing the FrFT is derived from its integral definition and, …

    brazil-ufpe Repository record for Chirp-Based decompositions for computing fractional fourier transforms (opens in a new tab)

  9. Fourier Transforms of Lipschitz Functions on Compact Groups

    … compact abelian group, it is well-known that the Fourier transform f of f lies in L^q(r), where 1/p + 1/q = 1 and r is the dual group of G. This thesis is concerned with how this fact can be strengthened if it is known that f satisfies a Lipschitz condition. For certain kinds of compact groups …

    mcmaster Repository record for Fourier Transforms of Lipschitz Functions on Compact Groups (opens in a new tab)

  10. On the regularity of Fourier transforms and maximal functions

    … for every \(p \in (1,\infty]\) and whose Fourier transform has no Lebesgue points in a Cantor set of full Hausdorff dimension. We apply Kovač's maximal restriction principle to show that the same full-dimensional set is avoided by any Borel measure satisfying a nontrivial Fourier …

    birmingham Download PDF for On the regularity of Fourier transforms and maximal functions (opens in a new tab)

  11. Balayage of Fourier Transforms and the Theory of Frames

    … We examine the theory of Beurling on Balayage of Fourier transforms and the role of spectral synthesis in this theory. Beurling showed that if the condition of Balayage holds, then the lower frame bound for a Fourier frame exists under suitable hypothesis. We extend this theory to obtain lower …

    maryland Repository record for Balayage of Fourier Transforms and the Theory of Frames (opens in a new tab)

  12. Fourier Transforms of Functions on a Finite Abelian Group

    This paper presents a theory of Fourier transforms of complex-valued functions on a finite abelian group and investigates two applications of this theory. Chapter I is an introduction with remarks on notation. Basic theory, including Pontrvagin duality and the Poisson Summation formula, is the …

    unt Repository record for Fourier Transforms of Functions on a Finite Abelian Group (opens in a new tab)

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

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

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

    … that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability …

    qucosa-diss

Page 1 of 20