Fast DFT algorithms for length \(N=q*2^m\) (Q2724302)
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 DFT algorithms for length \(N=q*2^m\) |
scientific article; zbMATH DE number 1616129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast DFT algorithms for length \(N=q*2^m\) |
scientific article; zbMATH DE number 1616129 |
Statements
20 January 2003
0 references
digital signal processing
0 references
split-radix algorithm
0 references
discrete Fourier transforms
0 references
Fast DFT algorithms for length \(N=q*2^m\) (English)
0 references
