摘要
为减少离散傅里叶变换(DFT)算法的计算量,人们利用一种很自然的增减数据项的方法提出了递推傅里叶变换算法,但在某些情况下,该传统递推算法并不太适用。文中基于三角函数的和差公式以及线性方程组的求解,提出了一种新的递推离散傅里叶变换算法,它的计算量与传统递推算法接近,但可以解决传统递推算法不易解决的许多问题,如适用于人们提出的克服电力系统中衰减直流分量对DFT影响的一些方法中。
To reduce computational complexity of DFT,a recursive formula of DFT was put forward according to a natural idea of adding the latestdata item and deleting the firstone,butit can notbe used conveniently undersome situations.In this paper a new recursive DFT is proposed based on sum-and-difference formula of trigonometrical function and solution of linear equations.Its computation work is nearly the same as that of traditional recursive DFT,but it can solve many problems effectively which can' t be solved easily by traditional recursive DFT,such as algorithms for overcoming attenuation direct- current component part existing in power system.The new recursive DFT has a vast range of prospects.
出处
《电力系统自动化》
EI
CSCD
北大核心
2000年第5期28-31,共4页
Automation of Electric Power Systems
基金
河南省"九五"科技攻关项目! ( 96 112 0 12 5 )
关键词
离散傅里叶变换
继电保护
微机保护
电力系统
discrete fourier transformation DFT
recursive DFT
computer relay
attenuation direct-current component
