Share Email Print
cover

Proceedings Paper

Fast algorithm of discrete Walsh-Haar transformation
Author(s): Li Lu; Baochang Shi; Jinwen Tian; Jian Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Walsh-Haar function system that was first intruoduced by us is a new kind of function systems, and has a good global/local property. This function system is called Walsh ordering function system since its generation kernel functions belong to Walsh ordering Walsh function system. We worked out a recursive property of the matrix corresponding to the first Walsh-Haar functions in Walsh-Haar function system, and we also proved that Walsh-Haar function system is perfect and orthogonal similar to Walsh function system and Haar function system. Thus, discrete Walsh-Haar transformation (DW-HT) is an orthogonal transformation that can be widely used in signal processing. In this paper, using the recursive property of the matrix and the fast algorithm of discrete Walsh transformation (DWT) in Walsh ordering, we have designed a fast algorithm of Walsh ordering DW-HT based on the bisection technique. The idea and method used in this paper can be used for designing fast algorithms of other ordering DW-HTs and other discrete orthogonal transformations.

Paper Details

Date Published: 4 January 2006
PDF: 5 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 59853G (4 January 2006); doi: 10.1117/12.658163
Show Author Affiliations
Li Lu, Huazhong Univ. of Science and Technology (China)
Baochang Shi, Huazhong Univ. of Science and Technology (China)
Jinwen Tian, Huazhong Univ. of Science and Technology (China)
Jian Liu, Huazhong Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology
Cheng Wang; Shan Zhong; Xiulin Hu, Editor(s)

© SPIE. Terms of Use
Back to Top