Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Quick Fourier Transformation

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

Revisions


  

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

License

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

About the Author

Mosi_62
Software Developer (Senior) Aebi Maschinenfabrik, Burgdorf
Switzerland Switzerland
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 whit 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 | :)

| Advertise | Privacy | Mobile
Web03 | 2.8.140709.1 | Last Updated 9 May 2013
Article Copyright 2013 by Mosi_62
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid