检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄冬梅[1] 龚仁喜[1] 焦凤昌[1] 臧慧[1] 唐志涛[1]
出 处:《电力系统保护与控制》2014年第2期28-34,共7页Power System Protection and Control
基 金:国家自然科学基金项目(60962008)~~
摘 要:为解决快速傅里叶变换(FFT)在电力谐波分析存在的问题,在分析莱夫-文森特窗和三谱线插值算法特点的基础上,提出了一种基于莱夫-文森特窗三谱线插值的谐波分析算法,用曲线拟合方法获得了修正公式,并基于这个修正公式对电力谐波进行了仿真。仿真结果表明,相同条件下,该算法在处理简单的谐波信号时的时间小于0.225 ms,幅值修正误差小于-1.4×10-6%,处理复杂信号时的时间小于0.997 ms,幅值修正误差小于-9.68×10-6%。该方法不仅具有较高的检测精度,而且具有较快的运算速度。On the basis of the analysis of the Rife-Vincent window and the characteristics of triple-spectral-line interpolation algorithm, an approach for power harmonic analysis based on the Rife-Vincent window and the triple-spectral-line interpolation is proposed to solve the problems of fast Fourier transform in the power harmonic analysis, the modified formula is obtained by using polynomial fitting method and simulation of the power harmonics is made based on it. The simulation results show that under the same condition, it takes less than 0.225 ms and the amplitude correction error is less than -1.4×106% with the simple harmonic signals processed, while it takes less than 0.997 ms and the amplitude correction error is less than -9.68×10-6% with the complex signals dealt with. Therefore, the algorithm has not only higher detection precision, but also faster operation speed.
关 键 词:快速傅里叶变换 电力谐波分析 莱夫-文森特窗 三谱线插值 谐波信号
分 类 号:TM935[电气工程—电力电子与电力传动]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28