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 | |
| Publication status | Published - 1998 Dec 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
Cite this
}
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 journal › Article
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 -