Fast algorithm of discrete Walsh-Haar transformation

Li Lu; Baochang Shi; Jinwen Tian; Jian Liu

doi:10.1117/12.658163

4 January 2006 Fast algorithm of discrete Walsh-Haar transformation

Li Lu, Baochang Shi, Jinwen Tian, Jian Liu

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

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.

Citation Download Citation

Li Lu, Baochang Shi, Jinwen Tian, and Jian Liu "Fast algorithm of discrete Walsh-Haar transformation", Proc. SPIE 5985, International Conference on Space Information Technology, 59853G (4 January 2006); https://doi.org/10.1117/12.658163

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available