一种新的时域正负序列分量分解算法

2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491) Pub Date : 2003-07-13 DOI:10.1109/PES.2003.1267401

Yiqiao Liang

{"title":"一种新的时域正负序列分量分解算法","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":"{\"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}","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

摘要

本文提出了一种新的时域正、负序列分量分解算法。与现有算法相比，该算法具有响应速度快、通用性强等优点。文中还描述了该算法的两个特例。仿真结果与理论分析相吻合。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new time domain positive and negative sequence component decomposition algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491)

自引率

0.00%

发文量