一套新的dct和dst快速算法

Proceedings of 27th Asilomar Conference on Signals, Systems and Computers Pub Date : 1993-11-01 DOI:10.1109/ACSSC.1993.342631

P. S. Kumar, K. Prabhu

{"title":"一套新的dct和dst快速算法","authors":"P. S. Kumar, K. Prabhu","doi":"10.1109/ACSSC.1993.342631","DOIUrl":null,"url":null,"abstract":"Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A set of new fast algorithms for DCTs and DSTs\",\"authors\":\"P. S. Kumar, K. Prabhu\",\"doi\":\"10.1109/ACSSC.1993.342631\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods.<<ETX>>\",\"PeriodicalId\":266447,\"journal\":{\"name\":\"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"2008 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1993.342631\",\"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 27th Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1993.342631","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

使用简单的三角关系，快速算法已经开发用于计算离散余弦变换(dct)和正弦变换(DSTs)使用离散哈特利变换(DHT)。这些算法使用较小长度的dht并行计算dct和dst，并对数据进行一些额外的处理。它们的计算复杂度几乎等于使用其他方法的最快算法。

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

查看原文本刊更多论文

A set of new fast algorithms for DCTs and DSTs

Using simple trigonometric relations, fast algorithms have been developed for computing discrete cosine transforms (DCTs) and sine transforms (DSTs) using the discrete Hartley transform (DHT). These algorithms compute DCTs and DSTs using smaller length DHTs in parallel, with some additional processing of the data. Their computational complexity is almost equal to that of the fastest algorithms using other methods.<>

求助全文

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

来源期刊

Proceedings of 27th Asilomar Conference on Signals, Systems and Computers

自引率

0.00%

发文量