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 Nlog 2 N.

Strategies for the Synthesis of Fast Algorithms for the Computation of the Matrix-vector Products

“…Articles (Ţariov, 2012. ), , (Majorkowska-Mech and Cariow, 2012), (Cariow and Gliszczyński, 2012), , , (Cariow and Majorkowska-Mech, 2014), show the application of the described methodology for the synthesis of some fast data processing algorithms.…”

A Low-Complexity Approach to Computation of the Discrete Fractional Fourier Transform

“…Among other transformations, the discrete fractional Fourier transform is perhaps most frequently used. To date, a number of effective algorithms for various discrete fractional transforms have been developed [2,16,25]. Fractional Fourier transform (FRFT) is a generalization of the ordinary Fourier transform (FT) with one fractional parameter.…”

Fast Algorithms: Science, Art, Craft

“…Выводы. С помощью развиваемого подхода был разработан целый ряд эффективных алгоритмических решений, позволяющих уменьшить время выполнения вычислений при решении различных прикладных задач и/или упростить структуры вычислителей [15][16][17][18][19][20][21][22][23][24][25][26][27][28]…”