|
|
|
|
|
Dorota Majorkowska-Mech and Aleksandr Cariow
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, ...
ver más
|
|
|
|
|