DocumentCode :
68476
Title :
Recursive Algorithm for Sliding Walsh Hadamard Transform
Author :
Chun-Su Park
Author_Institution :
Inf. & Telecommun. Eng. Dept., Sangmyung Univ., Cheonan, South Korea
Volume :
62
Issue :
11
fYear :
2014
fDate :
1-Jun-14
Firstpage :
2827
Lastpage :
2836
Abstract :
In this paper, a recursive sliding transform (RST) algorithm is proposed for the fast implementation of the Walsh Hadamard Transform (WHT) on sliding windows. The proposed RST algorithm accelerates the sliding WHT process by recursively reducing the order of WHT. Theoretical analysis shows that the proposed RST algorithm requires only 1.33 additions per sample for each WHT basis vector regardless of the size or dimension of the basis vector. The computational requirement of the proposed RST algorithm is the lowest among existing fast sliding WHT algorithms.
Keywords :
Hadamard transforms; Walsh functions; Walsh Hadamard transform; block matching; recursive algorithm; recursive sliding transform; sliding transform; sliding windows; template matching; Acceleration; Algorithm design and analysis; Materials; Partitioning algorithms; Signal processing algorithms; Transforms; Vectors; Block matching; Walsh Hadamard transform; recursive algorithm; sliding transform; template matching;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2014.2316146
Filename :
6784357
Link To Document :
بازگشت