Fast algorithm for discrete fractional Hadamard transform

DOI10.1007/S11075-014-9862-8zbMATH Open1311.65174arXiv1507.05387OpenAlexW2003173774MaRDI QIDQ2017622FDOQ2017622

Dorota Majorkowska-Mech, Aleksandr Cariow

Publication date: 23 March 2015

Published in: Numerical Algorithms (Search for Journal in Brave)

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^2$ multiplications, while in proposed algorithm the number of real multiplications is reduced to $N$log${}_{2}N$.

Full work available at URL: https://arxiv.org/abs/1507.05387

Recommendations

• Fast computation of the discrete Hartley transform
• scientific article; zbMATH DE number 3951888
• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
• Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)
• New fast discrete Hartley transform algorithm

zbMATH Keywords

eigenvalue decompositionfast algorithmsdiscrete fractional Hadamard transformdiscrete linear transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Title not available (Why is that?)
• Hadamard matrices and their applications
• Title not available (Why is that?)
• The discrete fractional Fourier transform
• Discrete fractional Hartley and Fourier transforms
• A sign test for detecting the equivalence of Sylvester Hadamard matrices
• Ranks of Hadamard matrices and equivalence of Sylvester-Hadamard and pseudo-noise matrices
• The discrete fractional cosine and sine transforms
• A note on the eigenvectors of Hadamard matrices of order \(2^ n\).

Cited In (10)

• Title not available (Why is that?)
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• Decomposition of binary matrices and fast Hadamard transforms
• Fast computation of the discrete Walsh and Hadamard transforms
• Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)
• Split manageable efficient algorithm for Fourier and Hadamard transforms
• Title not available (Why is that?)
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• A low-complexity approach to computation of the discrete fractional Fourier transform
• Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms

This page was built for publication: Fast algorithm for discrete fractional Hadamard transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017622)