Hacker Blog Posts

Project Nayuki personal blog

Fast Fourier transform in x86 assembly

nayuki.io 8 min read

I have a simple fast Fourier transform implementation on the page Free small FFT in multiple languages , whose asymptotic time complexity is the optimal Θ( n log n ). I wanted to know how much additional speed-up could be obtained by reorganizing memory access patterns and using SIMD vector arithmetic instructions…
Read on nayuki.io → Discuss on HN (92) Archived copy
Points
158
HN comments
92
Submissions
1
Cited by
0 commenters

Math & AlgorithmsSoftware Engineering2016

On Hacker News

SubmittedTitle on HNPointsComments
Dec 10, 2016Fast Fourier transform in x86 assembly by gozzoo15892

More from Project Nayuki

All 8 posts →

Related posts from the same era