A New Fast Algorithm for Discrete Fractional Hadamard Transform
Aleksandr Cariow, Dorota Majorkowska-Mech, Janusz P. Papliński, Galina Cariowa · IEEE Transactions on Circuits and Systems I Regular Papers · 2019
This paper proposes a new fast algorithm for calculating the discrete fractional Hadamard transform for data vectors whose size N is a power of two. A direct method for the calculation of the discrete fractional Hadamard transform requires O(N2) multiplications, the last fast algorithm requires O(N log2N), while in the proposed algorithm the number of multiplications is reduced to O(N).