.png){kind=icon}
返回
Fast center weighted Hadamard transform algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/82.664256.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this brief, one-dimensional (1-D) and two-dimensional (2-D) fast algorithms for realizing the center weighted Hadamard transform (CWHT) are proposed, Based on the Kronecker product and direct sum operations, the proposed 1-D and 2-D CWHT algorithms through matrix decompositions require fewer computations than the existing methods, With low complexity and regular modularity, the proposed algorithms are suitable for VLSI implementation to achieve real-time signal processing and compression.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Pouteria citriodora, a New Species of Sapotaceae (Chrysophylloideae) from BrazilPouteria citriodora，巴西新发现的桑科（Chrysophylloideae亚科）物种
PREAI
分享收藏
分享收藏
没有更多内容
没有更多内容