Fast algorithm for discrete fractional Hadamard transform

Abstract

This paper proposes a fast algorithm for computing the discrete fractional Hadamard transform for the input vector of length N, being a power of two. A direct calculation of the discrete fractional Hadamard transform requires N 2 real multiplications, while in our algorithm the number of real multiplications is reduced to N log 2 N.