Results 231 to 240 of about 8,473 (273)
Some of the next articles are maybe not open access.
Discrete Fourier Transforms: DtFT and DFT
2021In 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, 2021The 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
Applied Optics, 1997
Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models,
J H, Reif, A, Tyagi
openaire +2 more sources
Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models,
J H, Reif, A, Tyagi
openaire +2 more sources
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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
A novel algorithm for digital overcurrent relay using discrete Fourier transform (DFT)
7th IET International Conference on Advances in Power System Control, Operation and Management (APSCOM 2006), 2006An over current protective relays has played very important role in maintaining reliability of a distribution system and protecting the equipment from the damage due to system fault. The performance of a relay is greatly determined by its sensitivity and response time.
Jiang, F., Bo, Z. Q., Chen, Zhe
openaire +2 more sources
Realization of a discrete Fourier transform (DFT) module for incorporation in FFT processors
Proceedings of the IEEE, 1977For 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, 2017In 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 ...
José Rodrigues de Oliveira-Neto +1 more
openaire +1 more source
Properties of the Discrete Fourier Transform (DFT)
1977This 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
Improved power converter line synchronisation using an adaptive Discrete Fourier Transform (DFT)
2002 IEEE 33rd Annual IEEE Power Electronics Specialists Conference. Proceedings (Cat. No.02CH37289), 2003The problem of line synchronisation for grid connected power converters where the grid is weak or comes from a remote area power supply with poor frequency governing, is now well recognised. Such supplies can suffer a significant amount of line voltage distortion due to notches caused by power device commutation and/or low frequency harmonic content ...
B.P. McGrath, D.G. Holmes, J. Galloway
openaire +1 more source
Fourier Transform Analysis of Discrete Time Signals and Systems—DTFT, DFT and FFT
2021In 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

