快速离散傅里叶变换的嵌套算法

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing Pub Date : 1988-04-11 DOI:10.1109/ICASSP.1988.196997

W. Siu

{"title":"快速离散傅里叶变换的嵌套算法","authors":"W. Siu","doi":"10.1109/ICASSP.1988.196997","DOIUrl":null,"url":null,"abstract":"The use of a nesting discrete Fourier transform technique to compute discrete Fourier transform is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nesting procedure. The speed of computation of this approach is comparable to the speed of computation of the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size.<<ETX>>","PeriodicalId":448544,"journal":{"name":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A nesting algorithm for very fast discrete Fourier transforms\",\"authors\":\"W. Siu\",\"doi\":\"10.1109/ICASSP.1988.196997\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The use of a nesting discrete Fourier transform technique to compute discrete Fourier transform is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nesting procedure. The speed of computation of this approach is comparable to the speed of computation of the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size.<<ETX>>\",\"PeriodicalId\":448544,\"journal\":{\"name\":\"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"126 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1988.196997\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1988.196997","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出利用嵌套离散傅里叶变换技术计算离散傅里叶变换。该技术仅依赖于两个基本模块，其他模块由标准嵌套过程生成。该方法的计算速度与WFTA的计算速度相当，而该方法的程序大小比WFTA小。这种方法最适合有内存大小限制的情况。

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

查看原文本刊更多论文

A nesting algorithm for very fast discrete Fourier transforms

The use of a nesting discrete Fourier transform technique to compute discrete Fourier transform is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nesting procedure. The speed of computation of this approach is comparable to the speed of computation of the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size.<>

求助全文

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

来源期刊

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing

自引率

0.00%

发文量