Fast center weighted hadamard transform algorithms

Chih Peng Fan, Jar-Ferr Yang

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

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
Volume45
Issue number3
DOIs
Publication statusPublished - 1998 Dec 1

Fingerprint

Hadamard transforms
Signal processing
Decomposition

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{52b0a0eba24045449dd92b25383ebe7a,
title = "Fast center weighted hadamard transform algorithms",
abstract = "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.",
author = "Fan, {Chih Peng} and Jar-Ferr Yang",
year = "1998",
month = "12",
day = "1",
doi = "10.1109/82.664256",
language = "English",
volume = "45",
pages = "429--432",
journal = "IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing",
issn = "1057-7130",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Fast center weighted hadamard transform algorithms. / Fan, Chih Peng; Yang, Jar-Ferr.

In: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 45, No. 3, 01.12.1998, p. 429-432.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Fast center weighted hadamard transform algorithms

AU - Fan, Chih Peng

AU - Yang, Jar-Ferr

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032025631&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032025631&partnerID=8YFLogxK

U2 - 10.1109/82.664256

DO - 10.1109/82.664256

M3 - Article

VL - 45

SP - 429

EP - 432

JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

SN - 1057-7130

IS - 3

ER -