Seminar series
Date
Tue, 21 Nov 2017
Time
14:30 -
15:00
Location
L5
Speaker
Andrew Thompson
Organisation
University of Oxford
I will describe a novel algorithm for computing the Walsh Hadamard Transform (WHT) which consists entirely of Haar wavelet transforms. The algorithm shares precisely the same serial complexity as the popular divide-and-conquer algorithm for the WHT. There is also a natural way to parallelize the algorithm which appears to have a number of attractive features.