DocumentCode :
1349827
Title :
Fast center weighted Hadamard transform algorithms
Author :
Fan, Chih-Peng ; Yang, Jar-Ferr
Author_Institution :
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
Volume :
45
Issue :
3
fYear :
1998
fDate :
3/1/1998 12:00:00 AM
Firstpage :
429
Lastpage :
432
Abstract :
In this paper, one-dimensional (1-D) and two-dimensional (2-D) 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
Keywords :
Hadamard transforms; VLSI; data compression; matrix decomposition; real-time systems; signal processing; 1D fast algorithms; 2D fast algorithms; CWHT algorithms; Kronecker product; VLSI implementation; center weighted Hadamard transform algorithms; compression; direct sum operations; matrix decompositions; modularity; real-time signal processing; Councils; Error correction; Error correction codes; Frequency; Matrix decomposition; Signal processing algorithms; Symmetric matrices; Very large scale integration; Video coding; Video signal processing;
fLanguage :
English
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7130
Type :
jour
DOI :
10.1109/82.664256
Filename :
664256
Link To Document :
بازگشت