Fast algorithm for discrete fractional Hadamard transform

DOI10.1007/S11075-014-9862-8MaRDI QIDQ2017622zbMATH OpenOpenAlexFDO

Authors Aleksandr Cariow, Dorota Majorkowska-Mech

Publication date 23 March 2015

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

eigenvalue decompositionfast algorithmsdiscrete fractional Hadamard transformdiscrete linear transforms

Mathematics Subject Classification ID

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

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$.

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

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3297944 (Why is no real title available?)
• A note on the eigenvectors of Hadamard matrices of order \(2^ n\).
• A sign test for detecting the equivalence of Sylvester Hadamard matrices
• Discrete fractional Hartley and Fourier transforms
• Hadamard matrices and their applications
• Ranks of Hadamard matrices and equivalence of Sylvester-Hadamard and pseudo-noise matrices
• The discrete fractional Fourier transform
• The discrete fractional cosine and sine transforms

Cited in

(10)

• scientific article; zbMATH DE number 3951888 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 5811164 (Why is no real title available?)
• 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)