Discrete two dimensional Fourier transform in polar coordinates part II: numerical computation and approximation of the continuous transform [PDF]
PeerJ Computer Science, 2020 The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date.
Xueyang Yao, Natalie Baddour
doaj +2 more sources
Generalizing the discrete fourier transform
Discrete Mathematics, 1985 The author defines the generalized discrete Fourier transform (GDFT (\({\mathbb{F}}G))\) as being the mapping \(\sigma_ G: {\mathbb{F}}G\to A_ 1\oplus...\oplus A_ s\) which decomposes the semisimple group algebra \({\mathbb{F}}G\) into simple Wedderburn components \(A_ i\), \(i=1,...,s\).
openaire +2 more sources
A Discrete Fourier-Cosine Transform Chip [PDF]
IEEE Journal on Selected Areas in Communications, 1986 An 8-point Fourier-cosine transform chip designed for a data rate of 100 Mbits/s is described. The top-down design is presented step by step, including algorithm modification for VLSI suitability, architectural choices, testing overhead, internal precision assignments, mask generation, and finally, verification of the layout.
Martin Vetterli, Adriaan Ligtenberg
openaire +1 more source
Coherent Dynamics of Quantum Systems with Non-Uniform Fourier Space Excited by Laser Radiation
Zanco Journal of Pure and Applied Sciences, 2022 The algorithm is presented to solve dynamical equations for excitation of molecular models with multiple energy levels. It uses only discrete structures: discrete orthogonal polynomials constructed specially in Fourier space of the probability amplitudes,
Sary Banjak , Vadim Savva
doaj +1 more source
FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform
IEEE Access, 2022 Discrete Fourier transform (DFT) is a widely used method of signal analysis in digital signal processing. The DFT converts a signal from time domain to frequency domain for further processing.
Peter Plesznik +2 more
doaj +1 more source
Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics [PDF]
, 2011 Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach.
Burt, G. M., Roscoe, A. J.
core +3 more sources
Two-Dimensional Discrete Coupled Fractional Fourier Transform (DCFrFT)
Fractal and FractionalThe fractional Fourier transform is critical in signal processing and supports many applications. Signal processing is one notable application. Implementing the fractional Fourier transform requires discrete versions.
Asma Elshamy +2 more
doaj +1 more source
Non-Iterative DOA Estimation Using Discrete Fourier Transform Interpolation
IEEE Access, 2019 A fast and accurate non-iterative direction-of-arrival (DOA) estimation algorithm for multiple targets in additive white Gaussian noise is devised in this paper.
Yuan Chen +4 more
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Design And Implementation Of Radix-4 Fast Fourier Transform In Asia Chip With 0.18 M Standard CMOS Technology [TK5102.9. S624 2008 f rb]. [PDF]
, 2008 Jelmaan Fourier pantas (FFT) merupakan blok yang penting dan digunakan secara meluas dalam algoritma pemprosesan isyarat digital. The Fast Fourier Transform (FFT) is a critical block and widely used in digital signal processing ...
Palaniappan, Siva Kumar
core +1 more source