.png){kind=icon}
返回
An efficient algorithm for the 2-D discrete cosine transform
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(96)00132-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an efficient algorithm for computing the 2-D discrete cosine transform (DCT). First, we arrange the input data matrix in a certain order. Second, we formulate the output data matrix to a block-structured matrix-vector multiplication, and show that the block-structured matrix has the same properties as the 1-D DCT kernel matrix. Therefore, the 2-D DCT problem is reduced to the 1-D DCT problem. We thus can provide a procedure for computing the 2-D DCT which is similar to that of the 1-D DCT. The primary appeal of this algorithm lies not only in its low computational cost but also in its regular structure as the transform size increases.
Keyword:
2-D discrete cosine transform
recursive algorithm
signal-flow graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Risk Factor and Prediction Modeling for Sudden Cardiac Death in Women With Coronary Artery Disease
OAAI
OAAI分享收藏 没有更多内容
没有更多内容