Fast 2-Dimensional Hadamard Transform

Abstract

The Hadamard transform (HT) has been used extensively in image and speech applications. The advantage of HT is that the procedure of the transform is simple and fast, because there are only +/- operations involved. In this paper, a fast 2-dim HT is presented, which utilizes less amount of +/- operations than the direct method. The fast algorithm is done by successive Harr wavelet transforms (Harr WT). For both methods, the exact amounts of +/- operations are counted. The fast algorithm is verified using C++ programs. Using this new method, the transform speed can be enhanced effectively.