Fast algorithm for Walsh Hadamard Transform on sliding windows.
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.
Ouyang
Wanli
W
Department of Electronic Engineering, The Chinese University of Hong Kong, Ho Sin Hang Engineering Building, Hong Kong, Shatin, NT, Hong Kong. wlouyang@ee.cuhk.edu.hk
Cham
Wai-Kuen
WK