Fast center weighted hadamard transform algorithms

Chih Peng Fan, Jar Ferr Yang

Research output: Contribution to journalArticlepeer-review

27 Citations (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.

Original languageEnglish
Pages (from-to)429-432
Number of pages4
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Issue number3
Publication statusPublished - 1998

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast center weighted hadamard transform algorithms'. Together they form a unique fingerprint.

Cite this