The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper introduces a new strategy for power systems harmonics analysis based on N=L×10M-point DFTs. When the fundamental frequency of a power system signal is 50 Hz, a sampling frequency 2000 Hz is selected, N=L×10M-point DFTs can reduce spectral leakage and obtain high accuracy harmonic parameters. The simulation results in MATLAB show that the strategy are feasible, and comparing with the harmonic...
Based on particle swarm optimization (PSO) and artificial bee colony (ABC), a novel hybrid swarm intelligent algorithm is developed in this paper. Two information exchanging processes are introduced to share valuable information mutually between particle swarm and bee colony. Numerical results show that the proposed method is effective and performs better than both PSO and ABC.
An efficient algorithm for computing 10-point DFT, which can contribute fast algorithms to more N-point DFTs, is developed. The computation of one 10-point DFT requires only 20 real multiplications, 84 real additions and 4 real right-shiftings 2 bits. According to the principles of decimation-in-time (DIT) or decimation-in-frequency (DIF) or double factors algorithm and the efficient algorithm of...
An algorithm for computing 4M-point DFT based on 4-point DFT block is developed. The new algorithm, in comparison to radix-4 FFT algorithm, requires the same number of additions and multiplications, but employs a dissimilar flow-graph. In the flow-graph of the new algorithm, the 4-point DFT blocks replace the accustomed butterfly computational networks. The new algorithm permits one 4M-point DFT to...
An efficient algorithm for computing 4M x24 point DFT, called radix-4-24p efficient FFT algorithm (EFFT), is developed. To convert the computation of DFT of length N=4M x 24 in M steps to the computation of 4 DFTs of length 24 by radix-4 decimation in time algorithm and from Mth to first , each step converts four DFTs of length L x 24 into one DFT of length (4 x L)x24 are the basic mentality, and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.