diff options
| author | FreeArtMan <dos21h@gmail.com> | 2021-08-26 07:54:57 +0100 |
|---|---|---|
| committer | FreeArtMan <dos21h@gmail.com> | 2021-08-26 07:54:57 +0100 |
| commit | 8f85479f511d67389b89e5df5a992234f9ec926b (patch) | |
| tree | e3dbe9304ef9d61978798558164599f025df72ac | |
| parent | 6b0a499024166602128c586e73604461828c792a (diff) | |
| download | md-content-8f85479f511d67389b89e5df5a992234f9ec926b.tar.gz md-content-8f85479f511d67389b89e5df5a992234f9ec926b.zip | |
Add more words to naitve fft
| -rw-r--r-- | md/writeup/naive_fft_implementation_in_c.md | 9 |
1 files changed, 6 insertions, 3 deletions
diff --git a/md/writeup/naive_fft_implementation_in_c.md b/md/writeup/naive_fft_implementation_in_c.md index 80c1ea6..e5729ee 100644 --- a/md/writeup/naive_fft_implementation_in_c.md +++ b/md/writeup/naive_fft_implementation_in_c.md @@ -84,7 +84,9 @@ DFT speed is $$ O(N^2)$$ and FFT becomes as $$ O(N\log N) $$ -#### Shuffling arrays +#### Shuffling data + +Rearranging data before running FFT ```c void ffti_shuffle_1(double *x_i, double *x_q, uint64_t n) { @@ -134,7 +136,7 @@ void ffti_shuffle_1(double *x_i, double *x_q, uint64_t n) { ``` -#### Implementation +#### FFT Implementation ```c void fft_1(double *x_i, double *x_q, uint64_t n, uint64_t inv) { @@ -191,9 +193,10 @@ void fft_1(double *x_i, double *x_q, uint64_t n, uint64_t inv) { ``` - ## Octave verification code +Quick verification of FFT and DFT with octave code + ```matlab data1 = [1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0] res1 = fft(data1) |