Fast Algorithm for Walsh Hadamard Transform on Sliding Windows

Authors:
Wanli Ouyang;W. K. Cham
Affiliations:
The Chinese University of Hong Kong, Hong Kong;The Chinese University of Hong Kong, Hong Kong
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2010

Citing 0
Cited 2

Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform

IEEE Transactions on Signal Processing
Adaptive Low Resolution Pruning for fast Full Search-equivalent pattern matching

Pattern Recognition Letters

Quantified Score

Hi-index	0.15

Visualization

Abstract

This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational requirement of the proposed algorithm is about 1.5 additions per projection vector per sample, which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding windows.