Click here to Skip to main content
11,639,554 members (61,709 online)
Click here to Skip to main content
Alternatives

Tagged as

Quick Fourier Transformation

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

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

License

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

Share

About the Author

Mosi_62
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...

| | Privacy | Terms of Use | Mobile
Web01 | 2.8.150731.1 | Last Updated 9 May 2013
Article Copyright 2013 by Mosi_62
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid