重叠数据段的DFT计算

[1991 Proceedings] 6th Mediterranean Electrotechnical Conference Pub Date : 1991-05-22 DOI:10.1109/MELCON.1991.161860

R. Stasinski

{"title":"重叠数据段的DFT计算","authors":"R. Stasinski","doi":"10.1109/MELCON.1991.161860","DOIUrl":null,"url":null,"abstract":"A DFT algorithm for overlapping data segments requiring O(NlogK) and not the usual O(NlogN) operations is described. K is the number of new input data samples. The algorithm forms a basis for an improved block-filtering algorithm requiring O(NlogK) operations. The same computational complexity can be achieved for the adaptive version of block-filtering algorithm, if the improved algorithm for frequency-domain sampled filters is introduced.<<ETX>>","PeriodicalId":193917,"journal":{"name":"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DFT computation for overlapping data segments\",\"authors\":\"R. Stasinski\",\"doi\":\"10.1109/MELCON.1991.161860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A DFT algorithm for overlapping data segments requiring O(NlogK) and not the usual O(NlogN) operations is described. K is the number of new input data samples. The algorithm forms a basis for an improved block-filtering algorithm requiring O(NlogK) operations. The same computational complexity can be achieved for the adaptive version of block-filtering algorithm, if the improved algorithm for frequency-domain sampled filters is introduced.<<ETX>>\",\"PeriodicalId\":193917,\"journal\":{\"name\":\"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MELCON.1991.161860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] 6th Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.1991.161860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

描述了一种需要O(NlogK)而不是通常的O(NlogN)操作的重叠数据段的DFT算法。K是新输入数据样本的个数。该算法为需要O(NlogK)运算的改进块过滤算法奠定了基础。如果引入改进的频域采样滤波器算法，则自适应版块滤波算法可以实现相同的计算复杂度。

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

查看原文本刊更多论文

DFT computation for overlapping data segments

A DFT algorithm for overlapping data segments requiring O(NlogK) and not the usual O(NlogN) operations is described. K is the number of new input data samples. The algorithm forms a basis for an improved block-filtering algorithm requiring O(NlogK) operations. The same computational complexity can be achieved for the adaptive version of block-filtering algorithm, if the improved algorithm for frequency-domain sampled filters is introduced.<>

求助全文

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

来源期刊

[1991 Proceedings] 6th Mediterranean Electrotechnical Conference

自引率

0.00%

发文量