An Algorithm for Discrete Cosine Transform of Length p’

Zeng Yonghong

您当前的位置：

首页 >

文章列表页 >

An Algorithm for Discrete Cosine Transform of Length p’

更新时间：2025-12-08

- An Algorithm for Discrete Cosine Transform of Length p’
- Acta Electronica Sinica Issue 5, Pages: 87-95(1991)
- 作者机构：
  
  国防科技大学,长沙
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1991
- 稿件说明：
移动端阅览
[1]曾永红.长度为P~l的离散余弦变换算法[J].电子学报,1991(05):87-95.

Zeng Yonghong. An Algorithm for Discrete Cosine Transform of Length p’[J]. Acta Electronica Sinica, 1991, (5): 87-95.
[1]曾永红.长度为P~l的离散余弦变换算法[J].电子学报,1991(05):87-95. DOI：

Zeng Yonghong. An Algorithm for Discrete Cosine Transform of Length p’[J]. Acta Electronica Sinica, 1991, (5): 87-95. DOI：

摘要

本文对长度为p′（P为任意自然数）的余弦变换DCT-Ⅱ提出了一种快速算法

并对如何减少运算量做了详细讨论。当P=2时

本算法和目前最快算法的运算量一样

且结构简单。结合B.G.Lee提出的把一维DCT转化为多维DCT计算的方法可计算任意长度的DCT-Ⅱ。

Abstract

This paper proposes an algorithm for Discrete Consine Transform （DCT-Ⅱ） of length p’ （p is an arbitrary positive integer）. The methods for reducing the time complexity are discussed in detail. The algorithm is different from that by converting DCT into DFT and using FFT. Combining with B. G. Lee’s prime-factor-decomposed algorithm

this algorithm can compute DCT-Ⅱ of arbitrary length.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰