Fast fourier transform algorithm written on IEC-61131-3 Structured text programming language for programmable logic controllers.

Algorithm is split-radix FFT. StFFT is iterative contrary to more common recursive approach. Iterative solution was chosen because PLCs don't have support for recursion. For compatibility with as many as possible PLC models, algorithm have dependency only on sine and cosine functions.

Dual licenced under LGPL and Commercial licence. For commercial licencing contact tamitech@tamitech.fi

Author
Jaakko Pasanen

Project Activity

See All Activity >

License

GNU Library or Lesser General Public License version 3.0 (LGPLv3)

Follow StFFT

StFFT Web Site

Other Useful Business Software
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Claim $300 Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of StFFT!

Additional Project Details

Registered

2013-07-31
Report inappropriate content