✦ LIBER ✦
Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms
✍ Scribed by Duhamel, P.
- Book ID
- 114559358
- Publisher
- IEEE
- Year
- 1990
- Weight
- 704 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0096-3518
- DOI
- 10.1109/29.60070
No coin nor oath required. For personal study only.