Some FFT Algorithms for Small-Length Real-Valued Sequences
This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued sequences of lengths from 3 to 9. Since calculating the real-valued DFT using the complex-valued FFT is redundant regarding the number of needed operations, the developed algorithms do not operate on com...
| Published in: | Applied Sciences |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-05-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/9/4700 |