4 January 2006 Fast algorithm of discrete Walsh-Haar transformation
Author Affiliations +
Proceedings Volume 5985, International Conference on Space Information Technology; 59853G (2006) https://doi.org/10.1117/12.658163
Event: International Conference on Space information Technology, 2005, Wuhan, China
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Li Lu, Li Lu, Baochang Shi, Baochang Shi, Jinwen Tian, Jinwen Tian, Jian Liu, Jian Liu, "Fast algorithm of discrete Walsh-Haar transformation", Proc. SPIE 5985, International Conference on Space Information Technology, 59853G (4 January 2006); doi: 10.1117/12.658163; https://doi.org/10.1117/12.658163

Back to Top