一种新的并行快速余弦变换算法

Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510) Pub Date : 2001-07-01 DOI:10.1109/IDAACS.2001.941992

A. Melnyk, Y. Ermetov

{"title":"一种新的并行快速余弦变换算法","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":"{\"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}","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

摘要

提出了一种快速余弦变换(FCT)计算算法。由此产生的FCT算法具有连续添加操作的特点，在并行FCT计算的情况下，这会导致很大的时间延迟或需要大量额外的硬件。与通常的FCT算法中连续操作的数量相比，新的FCT算法中并行操作的数量相同。这提供了并行FCT计算的简单实现，而无需额外的时间和硬件开销。

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

查看原文本刊更多论文

A new parallel fast cosine transform algorithm

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.

求助全文

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

来源期刊

Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)

自引率

0.00%

发文量