Skip to content

Commit 93c76a5

Browse files
committed
Updating cooley_tukey.md
1 parent 60816d4 commit 93c76a5

File tree

1 file changed

+6
-0
lines changed

1 file changed

+6
-0
lines changed

contents/cooley_tukey/cooley_tukey.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -83,6 +83,8 @@ For some reason, though, putting code to this transformation really helped me fi
8383
[import:5-11, lang:"python"](code/python/fft.py)
8484
{% sample lang="scratch" %}
8585
[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)
8688
{% endmethod %}
8789

8890
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:
130132
[import:13-24, lang:"python"](code/python/fft.py)
131133
{% sample lang="scratch" %}
132134
[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)
133137
{% endmethod %}
134138

135139
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
236240
[import, lang:"python"](code/python/fft.py)
237241
{% sample lang="scratch" %}
238242
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)
239245
{% endmethod %}
240246

241247

0 commit comments

Comments
 (0)