A note on prime factor FFT algorithms (Q1050757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9991(83)90024-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1516217143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Fourier Transform Algorithm Using Base 8 Iterations / 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: Q5615107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A prime factor FFT algorithm using high-speed convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of discrete Fourier transforms using polynomial transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to programming the Winograd Fourier transform algorithm (WFTA) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-sorting mixed-radix fast Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: A prescription of winograd's discrete Fourier transform algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:20, 14 June 2024

scientific article
Language Label Description Also known as
English
A note on prime factor FFT algorithms
scientific article

    Statements

    A note on prime factor FFT algorithms (English)
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete Fourier transforms
    0 references
    large-scale scientific computers
    0 references
    vector machines
    0 references
    prime factor algorithms
    0 references
    fast Fourier transform
    0 references
    0 references