Fast center weighted hadamard transform algorithms

Chih Peng Fan, Jar Ferr Yang

研究成果: Article同行評審

27 引文 斯高帕斯(Scopus)

摘要

In this brief, one-dimensional (1-D) and two-dimensional (2D) 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.

原文English
頁(從 - 到)429-432
頁數4
期刊IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
45
發行號3
DOIs
出版狀態Published - 1998

All Science Journal Classification (ASJC) codes

  • 訊號處理
  • 電氣與電子工程

指紋

深入研究「Fast center weighted hadamard transform algorithms」主題。共同形成了獨特的指紋。

引用此