A new time domain positive and negative sequence component decomposition algorithm

Yiqiao Liang
{"title":"A new time domain positive and negative sequence component decomposition algorithm","authors":"Yiqiao Liang","doi":"10.1109/PES.2003.1267401","DOIUrl":null,"url":null,"abstract":"In this paper, a new time domain positive and negative sequence component decomposition algorithms is derived. Comparing to the existing algorithms, this new algorithm is faster in response, and more generic. Two special cases of this new algorithm are also described in the paper. Simulations are carried out, and the results are in line with the theoretical analysis.","PeriodicalId":131986,"journal":{"name":"2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PES.2003.1267401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

In this paper, a new time domain positive and negative sequence component decomposition algorithms is derived. Comparing to the existing algorithms, this new algorithm is faster in response, and more generic. Two special cases of this new algorithm are also described in the paper. Simulations are carried out, and the results are in line with the theoretical analysis.
一种新的时域正负序列分量分解算法
本文提出了一种新的时域正、负序列分量分解算法。与现有算法相比,该算法具有响应速度快、通用性强等优点。文中还描述了该算法的两个特例。仿真结果与理论分析相吻合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信