Opening book details…
About this Computer Science article
Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms by Duhamel, P. is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Duhamel, P.
- Publisher
- IEEE; Institute of Electrical and Electronics Engineers; Institute of Electrical and Electronics Engineers (IEEE) (ISSN 0096-3518)
- Published
- 1990
- Field
- Computer Science (Physical Sciences)