<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Numerical-Computing on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/numerical-computing/</link>
    <description>Recent content in Numerical-Computing on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 21 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/numerical-computing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted FFT Libraries: FFTW vs KissFFT vs PFFFT vs muFFT — Choosing the Right Signal Processing Engine</title>
      <link>https://www.pistack.xyz/posts/2026-06-21-fft-libraries-fftw-kissfft-pffft-mufft/</link>
      <pubDate>Sun, 21 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-21-fft-libraries-fftw-kissfft-pffft-mufft/</guid>
      <description>&lt;h2 id=&#34;why-fast-fourier-transform-libraries-matter&#34;&gt;Why Fast Fourier Transform Libraries Matter&lt;/h2&gt;&#xA;&lt;p&gt;The Fast Fourier Transform (FFT) is the computational backbone of digital signal processing. From audio analysis and RF signal decoding to scientific simulations and image compression, FFT libraries convert time-domain signals into frequency-domain representations in O(n log n) time rather than the naive O(n²). The choice of FFT library directly impacts your application&amp;rsquo;s performance, memory footprint, and accuracy across platforms.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
