An algorithm for discrete fractional Hadamard transform
Data Structures and Algorithms
2015-07-21 v1
Abstract
We present a novel algorithm for calculating the discrete fractional Hadamard transform for data vectors whose size N is a power of two. A direct method for calculation of the discrete fractional Hadamard transform requires multiplications, while in proposed algorithm the number of real multiplications is reduced to log.
Keywords
Cite
@article{arxiv.1507.05387,
title = {An algorithm for discrete fractional Hadamard transform},
author = {Aleksandr Cariow and Dorota Majorkowska-Mech},
journal= {arXiv preprint arXiv:1507.05387},
year = {2015}
}
Comments
22 pages, 4 figures