Results 241 to 250 of about 1,921,662 (293)

Discrete Fourier Transform Techniques for Noise Reduction and Digital Enhancement of Analytical Signals

, 2021
Comprehensive details of problem solving approaches with discrete Fourier transform (DFT are presented with reference to current separation science applications, which are equally applicable to spectroscopic data.
M. F. Wahab, F. Gritti, T. O'Haver
semanticscholar   +1 more source

Improvements to the Sliding Discrete Fourier Transform Algorithm [Tips & Tricks]

IEEE Signal Processing Magazine, 2021
This article presents two networks that improve upon the behavior and performance of previously published sliding discrete Fourier transform (SDFT) algorithms.
R. Lyons, Carl Howard
semanticscholar   +1 more source

An efficient blind color image watermarking algorithm in spatial domain combining discrete Fourier transform

, 2020
For achieving the purpose of rapid protection of color image copyright better, a novel color image blind watermarking algorithm is proposed in this paper, which integrates discrete Fourier transform (DFT) in spatial domain.
Xueting Zhang, Qingtang Su, Yuan Zihan, Liu Decheng   +3 more
semanticscholar   +1 more source

Discrete Fourier Transforms: DtFT and DFT

2021
In this chapter we investigate a big family of Fourier transforms: continuous Fourier transform (CFT), Fourier series (FS), discrete-time Fourier transform (DtFT), and discrete Fourier transform (DFT). The DFT, in its fast form (FFT), is probably one of the most frequently used orthogonal transforms in the world apart from the discrete cosine transform
openaire   +1 more source

High-resolution spectral analysis (HSA) vs. discrete fourier transform (DFT)

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, 2021
The Discrete Fourier Transform (DFT) is the standard technique for performing spectral analysis. It is used in the form of the well-known fast implementation (FFT) in almost all areas that deal with signal processing. However, the DFT algorithm has some limitations in terms of its resolution in time and frequency: the higher the time resolution, the ...
Roland Sottek, Thiago Lobato
openaire   +1 more source

Measuring stock market resiliency with Discrete Fourier Transform for high frequency data

Physica A: Statistical Mechanics and its Applications, 2019
In this paper, we investigate market resiliency as one of the stock market liquidity dimensions. A new methodology for stock resiliency measurement based on Discrete Fourier Transform (DFT) for high-frequency intraday data is introduced.
J. Olbryś, Michał Mursztyn
semanticscholar   +1 more source

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

Applied and Computational Harmonic Analysis
The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator.
Jielun Chen, Michael Lindsey
semanticscholar   +1 more source

Bi-dimensional multiscale entropy: Relation with discrete Fourier transform and biomedical application

Comput. Biol. Medicine, 2018
The multiscale entropy (MSE1D) measure is now widely used to quantify the complexity of time series. The development of complexity measures for images is also a long-standing goal.
A. Humeau-Heurtier, A. C. Omoto, L. E. V. Silva   +2 more
semanticscholar   +1 more source

Flexible systolic design with asynchronous communication protocols for discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT)

SPIE Proceedings, 1994
ABSTRACT In this paper, a spiral systolic array (SA) architecture with asynchronous controls forthe real time realization of an N point DFT and [DFT is considered. The study includes theoverall system block diagram, propagation of data between array PEs, operations withineach PE, and the PE protocol for computing an N point DFT.
Kamran Reihani, Wiley E. Thompson, Yiping Fan   +2 more
openaire   +1 more source

Evolution of Forward and Inverse Discrete Fourier Transform

East-West Design & Test Symposium, 2018
The problems of the evolution of the forward and inverse discrete Fourier transform are investigated. Forward and inverse discrete Fourier transform is the basis of the classical discrete spectral analysis of signals.
O. Ponomareva, A. Ponomarev, V. Ponomarev   +2 more
semanticscholar   +1 more source