Fast algorithm for discrete fractional Hadamard transform (Q2017622): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-014-9862-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003173774 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.05387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete fractional cosine and sine transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete fractional Hartley and Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the eigenvectors of Hadamard matrices of order \(2^ n\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sign test for detecting the equivalence of Sylvester Hadamard matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete fractional Fourier transform / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-014-9862-8 / rank
 
Normal rank

Latest revision as of 07:09, 28 December 2024

scientific article
Language Label Description Also known as
English
Fast algorithm for discrete fractional Hadamard transform
scientific article

    Statements

    Fast algorithm for discrete fractional Hadamard transform (English)
    0 references
    0 references
    23 March 2015
    0 references
    discrete linear transforms
    0 references
    discrete fractional Hadamard transform
    0 references
    eigenvalue decomposition
    0 references
    fast algorithms
    0 references

    Identifiers