离散余弦变换的新基数-3快速算法

Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993 Pub Date : 1993-05-24 DOI:10.1109/NAECON.1993.290898

Yiquan Wu, Zhaoda Zhu

{"title":"离散余弦变换的新基数-3快速算法","authors":"Yiquan Wu, Zhaoda Zhu","doi":"10.1109/NAECON.1993.290898","DOIUrl":null,"url":null,"abstract":"In this paper a new radix-3 fast algorithm for the length -3/sup m/ discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-3/sup 2/ FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-2/sup 1/.3/sup m/ DCT using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications.<<ETX>>","PeriodicalId":183796,"journal":{"name":"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New radix-3 fast algorithm for the discrete cosine transform\",\"authors\":\"Yiquan Wu, Zhaoda Zhu\",\"doi\":\"10.1109/NAECON.1993.290898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new radix-3 fast algorithm for the length -3/sup m/ discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-3/sup 2/ FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-2/sup 1/.3/sup m/ DCT using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications.<<ETX>>\",\"PeriodicalId\":183796,\"journal\":{\"name\":\"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAECON.1993.290898\",\"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 IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON.1993.290898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

为了进一步扩展快速余弦变换(FCT)算法的适用性，提出了长度为-3/sup m/离散余弦变换(DCT)的一种新的基数-3快速算法。首先，考虑基本的3点DCT。然后，推导了新的基数-3 FCT算法的计算公式。接下来，给出了基数-3 FCT算法的框图，并给出了长度-3/sup 2/ FCT的信号流程图来说明所提出的算法。最后，对计算复杂度进行了分析。该算法需要较少的算术运算，并允许就地计算。简单规则的结构使其易于实现。我们可以有效地计算长度-2/sup 1/。3/sup m/ DCT采用该长度-3/sup m/算法结合现有长度-2/sup 1/算法进行质因数分解。提出的新的基数-3 FCT算法有望得到广泛的实际应用。

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

查看原文本刊更多论文

New radix-3 fast algorithm for the discrete cosine transform

In this paper a new radix-3 fast algorithm for the length -3/sup m/ discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-3/sup 2/ FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-2/sup 1/.3/sup m/ DCT using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications.<>

求助全文

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

来源期刊

Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993

自引率

0.00%

发文量