.png){kind=icon}
返回
A fast 4 x 4 forward discrete tchebichef transform algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2007.898331.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The discrete Tchebichef transform (DTT) is a transform method based on discrete orthogonal Tchebichef polynomials, which have applications recently found in image analysis and compression. This letter introduces a new fast 4 x 4 forward DTT algorithm. The new algorithm requires only 32 multiplications and 66 additions, while the best-known method using two properties of the DTT requires 64 multiplications and 96 additions. The proposed method could be used as the base case for recursive computation of transform coefficients. Experimental results showing performance improvement over existing techniques are presented.
Keyword:
algorithms
discrete cosine transforms
discrete Tchebichef transform
image coding
signal processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Inclusion of Tenaris and Macropetalum in Brachystelma (Apocynaceae-Asclepiadoideae-Ceropegieae) inferred from non-coding nuclear and chloroplast DNA sequences基于非编码核基因组和叶绿体DNA序列推断将Tenaris和Macropetalum纳入Brachystelma (Apocynaceae-Asclepiadoideae-Ceropegieae)
PREAI
分享收藏 没有更多内容
没有更多内容