Module rustdct::algorithm [−][src]
Modules
| type2and3_butterflies |
Structs
| DCT1ConvertToFFT |
DCT Type 1 implementation that converts the problem into a FFT of size 2 * (n - 1) |
| DCT1Naive |
Naive O(n^2 ) DCT Type 1 implementation |
| DST1ConvertToFFT |
DST Type 1 implementation that converts the problem into a FFT of size 2 * (n + 1) |
| DST1Naive |
Naive O(n^2 ) DST Type 1 implementation |
| Type2And3ConvertToFFT |
DCT2, DST2, DCT3, and DST3 implementation that converts the problem into a FFT of the same size |
| Type2And3Naive |
Naive O(n^2 ) DCT Type 2, DST Type 2, DCT Type 3, and DST Type 3 implementation |
| Type2And3SplitRadix |
DCT2, DCT3, DST2, and DST3 implemention that recursively divides the problem in half. |
| Type4ConvertToFFTOdd |
DCT Type 4 and DST Type 4 implementation that converts the problem into a FFT of the same size. |
| Type4ConvertToType3Even |
DCT4 and DST4 implementation that converts the problem into two DCT3 of half size. |
| Type4Naive |
Naive O(n^2 ) DCT Type 4 and DST Type 4 implementation |