The Harr Transform  Its Theory and Computer Implementation

The Harr Transform Its Theory and Computer Implementation

4.62 - 362 ratings

Title:The Harr Transform Its Theory and Computer Implementation
Author:
Edition language:English
ISBN-13:
Number of Pages:56 pages
Download Read Online

Haar functions, square wave step functions f various rates of value change or 'sequency', take on the values +1, -1, and O in the interval (O, 1). Since haar functions form an orthogonal system, any digital function or set of digital data can be represented as a linear combination of these functions, just as Fourier analysis represents data as a linear combination of sines and cosines. The Fast Haar Transform algorithm developed in this paper drastically reduces the number of operations required to transform a set of 16 data elements, i.e., from 256 to only 30. Therefore, one of the chief advantages that the Fast Haar Transform has over the Fast Fourier Transform is that it is between four and five times faster in terms of the number of computer calculations required, thereby reducing the cost of the computer time needed by 80 percent.

Related Book Of The Harr Transform Its Theory And Computer Implementation

The Harr Transform  Its Theory and Computer Implementation
Technical Abstract Bulletin
Government Reports Announcements   Index
Government Reports Annual Index
Soft Computing Techniques for Engineering Optimization