Results 201 to 210 of about 51,423 (250)

Sizing of Energy Storage and Diesel Generators in an Isolated Microgrid Using Discrete Fourier Transform (DFT)

IEEE Transactions on Sustainable Energy, 2014
This paper proposes a method for coordinated sizing of energy storage (ES) and diesel generators in an isolated microgrid based on discrete Fourier transform (DFT). ES and diesel generators have different response characteristics and can complementarily compensate the generation-demand imbalance at different time scales.
Jun Xiao, Linquan Bai, Fangxing Li, Haishen Liang, Chengshan Wang   +4 more
openaire   +3 more sources

Power Converter Line Synchronization Using a Discrete Fourier Transform (DFT) Based on a Variable Sample Rate

IEEE Transactions on Power Electronics, 2005
Line synchronization of grid connected power converters is a well recognized problem when the grid is weak, or derives from a remote area power supply with poor frequency regulation. Such systems can suffer significant line voltage distortion due to notches caused by power device switching and/or low frequency harmonic content, which can easily corrupt
B.P. McGrath, D.G. Holmes, J.J.H. Galloway Galloway   +2 more
openaire   +3 more sources

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

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

Time-frequency scaling property of Discrete Fourier Transform (DFT)

2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010
This paper presents the analogue of the time or frequency scaling theorem of continuous time/frequency Fourier Transform (FT) to the realm of Discrete Fourier Transform (DFT). The scaling property applies to scaling by integers which are relatively prime to the length of the DFT. The time reversal property of DFT is identified as a special case of this
Sumit A. Talwalkar, S. Lawrence Marple
openaire   +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

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), 2006
An 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

Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive

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

Eigenvectors of the DFT and discrete fractional fourier transform based on the bilinear transform

2010 IEEE 18th Signal Processing and Communications Applications Conference, 2010
Orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, are crucial to define the discrete fractional Fourier transform. In this work we determine the eigenvectors of the DFT matrix inspired by the bilinear transform.
Ahmet Serbes, Lutfiye Durak Ata
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), 2003
The 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