First-Fault Detection in DC Distribution With IT Grounding Based on Sliding Discrete Fourier-Transform
نویسندگان
چکیده
Since dc distribution minimizes the number of power conversion stages, it lowers overall cost, losses, and weight a system. Critical systems use IT grounding because is tolerant to first-fault. Hence, this an attractive option for hybrid electric aircraft (HEA), which combines gas engines with motors driven by electronic converters. This letter proposes accurate implementation procedure first-fault detection grounding. The ac component injection along sliding discrete Fourier transform (SDFT) used estimate fault impedance. very due heavy filtering implicit moving average filter. Further computation savings are obtained using double look-up tables, Goertzel algorithm SDFT. Results validated simulations experiments.
منابع مشابه
Detection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کاملRecursive sliding discrete Fourier transform with oversampled data
Article history: Available online 17 October 2013
متن کاملOnline Botnet Detection Based on Incremental Discrete Fourier Transform
Botnet detection has attracted lots of attention since botnet attack is becoming one of the most serious threats on the Internet. But little work has considered the online detection. In this paper, we propose a novel approach that can monitor the botnet activities in an online way. We define the concept of “feature streams” to describe raw network traffic. If some feature streams show high simi...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملDiscrete Fourier Transform on Multicores
This paper gives an overview on the techniques needed to implement the discrete Fourier transform (DFT) efficiently on current multicore systems. The focus is on Intel compatible multicores but we also discuss the IBM Cell, and briefly, graphics processing units (GPUs). The performance optimization is broken down into three key challenges: parallelization, vectorization, and memory hierarchy op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Electronics
سال: 2021
ISSN: ['1941-0107', '0885-8993']
DOI: https://doi.org/10.1109/tpel.2020.3026985