Results 211 to 220 of about 51,423 (250)
Some of the next articles are maybe not open access.

Realization of a discrete Fourier transform (DFT) module for incorporation in FFT processors

Proceedings of the IEEE, 1977
For applications requiring high-speed and in-place treatment, it is often advantageous to realize special-purpose computers. This paper describes a discrete Fourier transform (DFT) module for incorpration in fast Fourier transform (FFT) processors. The module is highly suitable for real input applications requiring high-speed transformations.
A. Pomerleau, M. Fournier, H.L. Buijs
openaire   +1 more source

Discrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors

IEEE Transactions on Signal Processing, 2017
In this paper, we construct discrete fractional Fourier transforms (DFrFT) using recently introduced closed-form Hermite–Gaussian-like (HGL) eigenvectors. With respect to such eigenvectors, we discuss the convergence of their components to samples of the corresponding continuous Hermite–Gaussian functions and propose solutions to deal with some ...
Jose R. de Oliveira Neto   +1 more
openaire   +1 more source

A high performance continuous data flow filter using sliding discrete Fourier transform (DFT) and one point inverse DFT

Proceedings. 1998 IEEE International Conference on Information Technology Applications in Biomedicine, ITAB '98 (Cat. No.98EX188), 2002
This paper presents a high performance frequency domain filter implementation for a moving window-type processing. The computational structure consists of three stages: a sliding discrete Fourier transform (SDFT) for a vectorized updating of the DFT; a frequency domain filter; and a one-point inverse discrete Fourier transform (IDFT).
null Wen Zhuo, E. Micheli-Tzanakou
openaire   +1 more source

Properties of the Discrete Fourier Transform (DFT)

1977
This paper will be divided into two parts. The first is intended as a companion to a tutorial session on those basic properties of the DFT which lead to Fast Fourier Transform algorithms. The second part will range more widely, in particular considering ways in which certain less well-known properties of the DFT could be turned to practical use.
openaire   +1 more source

Fourier Transform Analysis of Discrete Time Signals and Systems—DTFT, DFT and FFT

2021
In Chap. 4, we represented continuous time periodic signals as a sum of everlasting exponentials by Fourier series. Similarly, in Chap. 5, the discrete time periodic signals was represented by discrete time Fourier series using a parallel development of continuous time system.
openaire   +1 more source

DFT-CAM: Discrete Fourier Transform Driven Class Activation Map

2023 IEEE International Conference on Image Processing (ICIP), 2023
Yang Yang Wang, Filiz Bunyak
openaire   +1 more source

Measurement of time delay using the time shift property of the discrete Fourier transform (DFT)

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
The time shift property of the discrete Fourier transform (DFT) is used in the measurement of time delay. The eccentricity of a screw rod has been experimentally measured, and delays of the ultrasonic wave have been known with the precision of one percent of the temporal sampling interval.
openaire   +1 more source

Adaptive Digital Processing Investigation of DFT (Discrete Fourier Transform) Subbanding vs. Transversal Filter Canceler

1986
Abstract : A performance comparison investigation has been carried out for two multiple-weight, adaptive, canceler techniques; the discrete Fourier transform (DFT) band partitioning approach and the transversal filter canceler (TFC) approach. A simple two-channel canceler model was utilized, with all-digital processing, and four different types of ...
openaire   +1 more source

Discrete Fourier transform techniques for noise reduction and digital enhancement of analytical signals

TrAC - Trends in Analytical Chemistry, 2021
M Farooq Wahab   +2 more
exaly  

Home - About - Disclaimer - Privacy