Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform

1971 ◽  
Vol 59 (10) ◽  
pp. 1531-1532 ◽  
Author(s):  
J.L. Vernet
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Discrete Fourier Transform ◽  
Storage Capacity ◽  
Step Number

Fast Fourier Transform – Calculation and Interpretation

2008 ◽  
Vol 3 (4) ◽  
pp. 74-86
Author(s):  
Boris A. Knyazev ◽  
Valeriy S. Cherkasskij
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Discrete Fourier Transform ◽  
Signal Theory ◽  
Correct Interpretation ◽  
The Fourier Transform ◽  
Application Programs ◽  
Physics Problems

The article is intended to the students, who make their first steps in the application of the Fourier transform to physics problems. We examine several elementary examples from the signal theory and classic optics to show relation between continuous and discrete Fourier transform. Recipes for correct interpretation of the results of FDFT (Fast Discrete Fourier Transform) obtained with the commonly used application programs (Matlab, Mathcad, Mathematica) are given.

scholarly journals Application of two-dimensional fast Fourier transform algorithm, analog of the Cooley-Tukey algorithm, for 4k fixed format digital image of satellite data in frequency domain processing

2020 ◽  
Vol 149 ◽  
pp. 02010 ◽  
Author(s):  
Mikhail Noskov ◽  
Valeriy Tutatchikov
Keyword(s):  
Fourier Transform ◽  
Numerical Experiment ◽  
Fast Fourier Transform ◽  
Frequency Domain ◽  
Discrete Fourier Transform ◽  
Satellite Data ◽  
Digital Image ◽  
Digital Images ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm

Currently, digital images in the format Full HD (1920 * 1080 pixels) and 4K (4096 * 3072) are widespread. This article will consider the option of processing a similar image in the frequency domain. As an example, take a snapshot of the earth's surface. The discrete Fourier transform will be computed using a two-dimensional analogue of the Cooley-Tukey algorithm and in a standard way by rows and columns. Let us compare the required number of operations and the results of a numerical experiment. Consider the examples of image filtering.

scholarly journals R–DFT-based Parameter Estimation for WiGig

2017 ◽  
Vol 61 (2) ◽  
pp. 224
Author(s):  
Barna Csuka ◽  
Zsolt Kollár
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Parameter Estimation ◽  
Fast Fourier Transform ◽  
Discrete Fourier Transform ◽  
Low Complexity ◽  
Estimation Methods ◽  
Ieee 802.11Ad ◽  
Parameter Estimation Methods ◽  
Processing Architecture

In this paper we present parameter estimation methods for IEEE 802.11ad transmission to estimate the frequency offset value and channel impulse response. Furthermore a less known low complexity signal processing architecture – the Recursive Discrete Fourier Transform (R-DFT) – is applied which may improve the estimation results. The paper also discusses the R-DFT and its advantages compared to the conventional Fast Fourier Transform.

Computing the Fourier transform in geophysics with the transform decomposition DFT

Geophysics ◽  
1993 ◽  
Vol 58 (11) ◽  
pp. 1707-1709
Author(s):  
Michael J. Reed ◽  
Hung V. Nguyen ◽  
Ronald E. Chambers
Keyword(s):  
Fourier Transform ◽  
Phase Shift ◽  
Fast Fourier Transform ◽  
Discrete Fourier Transform ◽  
Large Percentage ◽  
Computationally Efficient ◽  
Operation Count ◽  
The Fourier Transform

The Fourier transform and its computationally efficient discrete implementation, the fast Fourier transform (FFT), are omnipresent in geophysical processing. While a general implementation of the discrete Fourier transform (DFT) will take on the order [Formula: see text] operations to compute the transform of an N point sequence, the FFT algorithm accomplishes the DFT with an operation count proportional to [Formula: see text] When a large percentage of the output coefficients of the transform are not desired, or a majority of the inputs to the transform are zero, it is possible to further reduce the computation required to perform the DFT. Here, we review one possible approach to accomplishing this reduction and indicate its application to phase‐shift migration.

scholarly journals PCA/DFT como herramienta de pronóstico para series temporales de absorbancia registradas mediante captores UV-Vis en sistemas de saneamiento urbano

Tecnura ◽  
2015 ◽  
Vol 19 (44) ◽  
pp. 47
Author(s):  
Leonardo Plazas Nossa ◽  
Andrés Torres
Keyword(s):  
Principal Component Analysis ◽  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Discrete Fourier Transform ◽  
Principal Component ◽  
Component Analysis ◽  
Inverse Fast Fourier Transform ◽  
San Fernando

El objetivo de este trabajo es presentar un método de pronóstico para series de tiempo de espectrometría UV-Vis, combinando el análisis de componentes principales PCA (Principal Component Analysis), la transformada discreta de Fourier, DFT (Discrete Fourier Transform) y la transformada inversa de Fourier, IFFT (Inverse Fast Fourier Transform). Se utilizaron las correspondientes series de tiempo de absorbancia para tres diferentes sitios de estudio: (i) Planta de tratamiento de aguas residuales Salitre (PTAR) en Bogotá; (ii) Estación elevadora de Gibraltar en Bogotá; y (iii) Planta de tratamiento de aguas residuales San Fernando (PTAR) en Itagüí (parte sur de Medellín). Cada una de las series de tiempo tiene igual número de muestras (5705). Al reducir la dimensionalidad de las series de tiempo de absorbancia con PCA, se utilizan para cada sitio de estudio 3, 5 y 6 componentes principales, respectivamente; explicando en conjunto más de 97% de la variabilidad. Se utiliza en el procedimiento DFT e IFFT el armónico más importante y se remueven desde uno hasta la mitad de los valores de la longitud total de las series de tiempo. Por consiguiente, los errores de pronóstico para los tres sitios de estudio y para tres rangos de longitudes de onda propuestos (UV, Vis y UV-Vis) están comprendidos entre 0,01% y 34% para 95% de los casos. Sin embargo, para 100% de los casos los errores son inferiores a 37%, independientemente de la longitud de onda y del tiempo de pronóstico.

Sign in / Sign up

Export Citation Format

Share Document