Fast algorithm for discrete fractional Hadamard transform

DOI10.1007/s11075-014-9862-8zbMath1311.65174arXiv1507.05387OpenAlexW2003173774MaRDI QIDQ2017622

Dorota Majorkowska-Mech, Aleksandr Cariow

Publication date: 23 March 2015

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

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

zbMATH Keywords

fast algorithmseigenvalue decompositiondiscrete fractional Hadamard transformdiscrete linear transforms

Mathematics Subject Classification ID

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

Related Items (1)

A low-complexity approach to computation of the discrete fractional Fourier transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sign test for detecting the equivalence of Sylvester Hadamard matrices
• A note on the eigenvectors of Hadamard matrices of order \(2^ n\).
• Discrete fractional Hartley and Fourier transforms
• The discrete fractional Fourier transform
• The discrete fractional cosine and sine transforms

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