user1095332
Reputation
Next privilege 100 Rep.
Edit community wikis
 Mar20 awarded Curious Jun6 awarded Popular Question Apr25 asked Flipping and convolution theorem Apr24 awarded Scholar Apr24 accepted trigonometry equations Apr23 comment Carl Friedrich Gauss and the 'useless' FFT in 1805 Can you quote the part in which Gauss stated that FFT was useless, please? Thank you! Apr23 revised Carl Friedrich Gauss and the 'useless' FFT in 1805 edited title Apr23 comment Carl Friedrich Gauss and the 'useless' FFT in 1805 Can you quote the part in which Gauss stated that FFT was useless, please? Thank you! Apr23 asked Carl Friedrich Gauss and the 'useless' FFT in 1805 Apr21 comment Explaining why FFT is faster than naive-DFT for the general public? "Gauss was a great mathmatician, he knew the FFT in 1805, way before computers were invented, but he didn't publish it, he thought it was useless (for a 16x16 for example)." He would rather die than trying to make it useful, and so he did! Nowadays, the Fast Fourier Transform is one of worldâ€™s most important emerging technologies. That's what a call drama... ;) Apr21 comment $j^2 = 1$, but $j \neq \pm 1$; what is $j$? How to prevent confusing with the 'j' in Quaternions? en.wikipedia.org/wiki/Quaternion Apr21 comment $j^2 = 1$, but $j \neq \pm 1$; what is $j$? In Electrical Engineering however, j is used instead of i. So j = $\sqrt{-1}$ as well (if you're an electrical engineer).. Apr19 comment How to distinguish between the different frequency domains? What are the exact differences between Fourier domain and s domain? Apr19 revised How to distinguish between the different frequency domains? added 124 characters in body Apr19 asked How to distinguish between the different frequency domains? Apr18 comment Explaining why FFT is faster than naive-DFT for the general public? @HenningMakholm It wasn't clear what I intended to say? Apr17 revised Explaining why FFT is faster than naive-DFT for the general public? added 34 characters in body; edited title Apr17 comment Explaining why FFT is faster than naive-DFT for the general public? @joriki How about selection sort vs mergesort? N^2 vs NlogN? DFT vs FFT? Apr17 comment Explaining why FFT is faster than naive-DFT for the general public? @kahen I know, just like mergesort is just a way of sorting as well ... :| Apr17 comment Explaining why FFT is faster than naive-DFT for the general public? To show how cool it is, that you can do something like a Fourier transform faster ;)