A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">$N=q\times 2^{m}$</tex></formula> DFTs (Q4579717)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6922879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">$N=q\times 2^{m}$</tex></formula> DFTs |
scientific article; zbMATH DE number 6922879 |
Statements
A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">$N=q\times 2^{m}$</tex></formula> DFTs (English)
0 references
22 August 2018
0 references
