@@ -83,6 +83,8 @@ For some reason, though, putting code to this transformation really helped me fi
83
83
[ import:5-11, lang:"python"] ( code/python/fft.py )
84
84
{% sample lang="scratch" %}
85
85
[ import:4-13, lang:"julia"] ( code/julia/fft.jl )
86
+ {% sample lang="asm-x64" %}
87
+ [ import:15-74, lang:"asm-x64"] ( code/asm-x64/fft.s )
86
88
{% endmethod %}
87
89
88
90
In this function, we define ` n ` to be a set of integers from $$ 0 \rightarrow N-1 $$ and arrange them to be a column.
@@ -130,6 +132,8 @@ In the end, the code looks like:
130
132
[ import:13-24, lang:"python"] ( code/python/fft.py )
131
133
{% sample lang="scratch" %}
132
134
[ import:16-32, lang:"julia"] ( code/julia/fft.jl )
135
+ {% sample lang="asm-x64" %}
136
+ [ import:76-165, lang:"asm-x64"] ( code/asm-x64/fft.s )
133
137
{% endmethod %}
134
138
135
139
As a side note, we are enforcing that the array must be a power of 2 for the operation to work.
@@ -236,6 +240,8 @@ Note: I implemented this in Julia because the code seems more straightforward in
236
240
[ import, lang:"python"] ( code/python/fft.py )
237
241
{% sample lang="scratch" %}
238
242
Some rather impressive scratch code was submitted by Jie and can be found here: https://scratch.mit.edu/projects/37759604/#editor
243
+ {% sample lang="asm-x64" %}
244
+ [ import, lang:"asm-x64"] ( code/asm-x64/fft.s )
239
245
{% endmethod %}
240
246
241
247
0 commit comments