{"title":"Goertzel-Blahut算法与快速傅里叶变换密切相关","authors":"S. Fedorenko","doi":"10.1109/RED.2012.6338398","DOIUrl":null,"url":null,"abstract":"The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"184 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Goertzel-Blahut algorithm is closely related to the fast fourier transform\",\"authors\":\"S. Fedorenko\",\"doi\":\"10.1109/RED.2012.6338398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.\",\"PeriodicalId\":403644,\"journal\":{\"name\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"184 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2012.6338398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Goertzel-Blahut algorithm is closely related to the fast fourier transform
The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
