Hello, Im student of 2 year of electronics from Poland. Once I was sitting and waiting on a corridor, and my tutor come to me and chat a while. Finally he gave me a task to think through. After few hours of intense thinking I started to bang my head over the wall.
Friend of mine recomended me that forum. Maybe you have some idea?
--------------------------------------------------------------------------------------
Heres the task:
Contemporary CPU consists of many FPU units (Floating Pointing Unit) allowing parallel calculation.
What is more, it is possible to equip a system with many CPU consisting of hundreds of FPU
(current trends is a horizontal scaling instead of vertical scaling – more CPUs instead of one fast CPU)
Is it possible to create such a system that execute plain DFT algorithm faster then FFT algorithm?
Of course I have sufficient number of FPU. Input data and
hardware are the same for both cases.
DFT has to be evaluated for N values which if done in the obvious way, clearly takes N² multiplications.
FFT takes only N*log2 N operations.
Friend of mine recomended me that forum. Maybe you have some idea?
--------------------------------------------------------------------------------------
Heres the task:
Contemporary CPU consists of many FPU units (Floating Pointing Unit) allowing parallel calculation.
What is more, it is possible to equip a system with many CPU consisting of hundreds of FPU
(current trends is a horizontal scaling instead of vertical scaling – more CPUs instead of one fast CPU)
Is it possible to create such a system that execute plain DFT algorithm faster then FFT algorithm?
Of course I have sufficient number of FPU. Input data and
hardware are the same for both cases.
DFT has to be evaluated for N values which if done in the obvious way, clearly takes N² multiplications.
FFT takes only N*log2 N operations.