{"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}
引用次数: 7
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
