Click here to Skip to main content
12,394,552 members (87,259 online)
Click here to Skip to main content

Tagged as


57 bookmarked

Quick Fourier Transformation

, 9 May 2013 CPOL
Some ideas to make the Discrete Fourier Transformation a bit quicker and implemented a lean version of the DFT algorithm.



Compare Revision Minor Date Status Editor
1 - publicly available No 9-May-13 14:30 Available Smitha Nishant
Initial creation


This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


About the Author

Software Developer (Senior) Aebi Maschinenfabrik, Burgdorf
Switzerland Switzerland
Computers are very straight... They always do exactly what we tell them to do... Only, much too often what we tell them to do is not really what we want them to do Smile | :)

Writing Software is one of the most creative tings one can do. I have been doing this for more than ten years now and still having a lot of fun with it. Besides doing software for farming Tractors for business, I enjoy very much to implement interesting algorithms and analyse the mathematics they are based on in my leisure time Smile | :)

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.160721.1 | Last Updated 9 May 2013
Article Copyright 2013 by Mosi_62
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid