Fast discrete Fourier transform computations using the reduced adder graph technique (Q838581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast discrete Fourier transform computations using the reduced adder graph technique |
scientific article; zbMATH DE number 5600545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast discrete Fourier transform computations using the reduced adder graph technique |
scientific article; zbMATH DE number 5600545 |
Statements
Fast discrete Fourier transform computations using the reduced adder graph technique (English)
0 references
1 September 2009
0 references
0.7492732405662537
0 references
0.744701623916626
0 references
0.7396801710128784
0 references
0.7363365888595581
0 references
0.7312390208244324
0 references
