Fast center weighted hadamard transform algorithms

Chih Peng Fan; Jar Ferr Yang

doi:10.1109/82.664256

Fast center weighted hadamard transform algorithms

Chih Peng Fan, Jar Ferr Yang

Institute of Computer and Communication Engineering

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	429-432
Number of pages	4
Journal	IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume	45
Issue number	3
DOIs	https://doi.org/10.1109/82.664256
Publication status	Published - 1998 Dec 1

Fingerprint

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering

Cite this

Fan, C. P., & Yang, J. F. (1998). Fast center weighted hadamard transform algorithms. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 45(3), 429-432. https://doi.org/10.1109/82.664256

@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 Yang, {Jar Ferr}",

year = "1998",

month = dec

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",

}

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

AN - SCOPUS:0032025631

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 -

Access to Document

10.1109/82.664256