.png){kind=icon}
返回
Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2005.852935.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, efficient recursive structures for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) and its inverse DCT (IDCT) are proposed. The M-D DCT and IDCT are first converted into condensed one-dimensional (1-D) DCT and discrete sine transform (DST) with a regular preprocessing procedure. The recursive filters for condensed 1-D DCT/DST are then derived by using Chebyshev polynomials to compute M-D DCT/IDCT without data transposition. The proposed structures require fewer recursive loops than traditional 1-D recursive structures, which are realized in M passes and (M - 1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than traditional row-column structures. The proposed recursive M-D DCT/IDCT structures are suitable for very large-scale integration implementation due to regular and modular features.
Keyword:
discrete cosine transform (DCT)
fast algorithm
inverse DCT (IDCT)
multidimensional signal processing
recursive structure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
暂无机构信息
引用论文
Driving Force Analysis of Proton Tunnelling Across a Reactivity Series for an Enzyme‐Substrate Complex.png)
ChemBioChem
ChemBioChemIF0
PREAI
分享收藏Neighbor Proximity Analysis, A Technique for Assessing Spatial Patterns in The Fossil RecordPALAIOS
PALAIOSIF0
PREAI
分享收藏
查看更多内容