An algorithm for discrete fractional Hadamard transform

2015/07/20 by Aleksandr Cariow, Cariow, Aleksandr, Dorota Majorkowska-Mech +1
Computer Science · Engineering · Mathematics · #Digital Filter Design and Implementation #Mathematical Analysis and Transform Methods #acm:15A04 #acm:15A23 #acm:65Y20 #cs.DS #graph theory and CDMA systems #msc:15A04 #msc:15A23 #msc:65Y20

paper · pdf · doi:10.48550/arxiv.1507.05387

22 pages, 4 figures

arxiv created 2015/07/20 · arxiv updated 2015/07/21

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 N² multiplications, while in proposed algorithm the number of real multiplications is reduced to Nlog₂N.

Citations

• Improved discrete fractional Fourier transform

Related

• Discrete fractional Fourier transform: Vandermonde approach
• Improved discrete fractional Fourier transform
• Multilayer Hadamard Decomposition of Discrete Hartley Transforms
• New Algorithms for Computing a Single Component of the Discrete Fourier Transform
• Radix-2 Fast Hartley Transform Revisited