Skip to content
Merged
6 changes: 5 additions & 1 deletion README.org
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ modern multicore processors.
:PROPERTIES:
:CUSTOM_ID: prospective-users
:END:
FDCP will be valuable in fieds where DCT is used extensively:
FDCT will be valuable in fieds where DCT is used extensively:

- Image processing and compression
- Audio processing and compression
Expand Down Expand Up @@ -136,3 +136,7 @@ multithread=True, simd=True)
[[https://coehuman.uodiyala.edu.iq/uploads/Coehuman%20library%20pdf/%D9%83%D8%AA%D8%A8%20%D8%A7%D9%84%D8%B1%D9%8A%D8%A7%D8%B6%D9%8A%D8%A7%D8%AA%20Mathematics%20books/Wavelets/25%20(2).pdf]]
3. C. W. Kok, Fast algorithm for computing discrete cosine transform
[[https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=558495]]
4. Nayuki, Fast discrete cosine transform algorithms
[[https://www.nayuki.io/page/fast-discrete-cosine-transform-algorithms]]
5. Nayuki, Free small FFT in multiple languages
[[https://www.nayuki.io/page/free-small-fft-in-multiple-languages]]
4 changes: 3 additions & 1 deletion ref/README.org
Original file line number Diff line number Diff line change
Expand Up @@ -2,4 +2,6 @@

This reference implementation is provided by Nayuki. I greatly appreciate their contribution.

For more details, please visit Nayuki's [[Website][https://www.nayuki.io/]]
For more details, please visit Nayuki's website
- https://www.nayuki.io/page/free-small-fft-in-multiple-languages
- https://www.nayuki.io/page/fast-discrete-cosine-transform-algorithms