The Tangent FFT (Q5386108): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145890086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier transforms: A tutorial review and a state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Split-Radix FFT With Fewer Arithmetic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new matrix approach to real FFTs and convolutions of length \(2^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple FFT and DCT algorithms with reduced number of operations. / rank
 
Normal rank

Latest revision as of 21:47, 27 June 2024

scientific article; zbMATH DE number 5265324
Language Label Description Also known as
English
The Tangent FFT
scientific article; zbMATH DE number 5265324

    Statements

    The Tangent FFT (English)
    0 references
    17 April 2008
    0 references
    0 references
    Tangent FFT
    0 references
    split-radix FFT
    0 references
    modified split-radix FFT
    0 references
    scaled odd tail
    0 references
    DFT
    0 references
    convolution
    0 references
    polynomial multiplication
    0 references
    algebraic complexity
    0 references
    communication complexity
    0 references
    0 references