{"title":"A new parallel fast cosine transform algorithm","authors":"A. Melnyk, Y. Ermetov","doi":"10.1109/IDAACS.2001.941992","DOIUrl":null,"url":null,"abstract":"A new algorithm for fast cosine transform (FCT) computation is proposed. The resulting FCT algorithm features consecutive adding operations which, in the case of parallel FCT computation, result in a large timing latency or require significant additional hardware. There are the same number of parallel operations in the new FCT algorithm compared to the number of consecutive operations in the usual FCT algorithm. This provides for a simple implementation of parallel FCT computations without extra timing and hardware expenses.","PeriodicalId":419022,"journal":{"name":"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)","volume":"66 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAACS.2001.941992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A new algorithm for fast cosine transform (FCT) computation is proposed. The resulting FCT algorithm features consecutive adding operations which, in the case of parallel FCT computation, result in a large timing latency or require significant additional hardware. There are the same number of parallel operations in the new FCT algorithm compared to the number of consecutive operations in the usual FCT algorithm. This provides for a simple implementation of parallel FCT computations without extra timing and hardware expenses.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
