您要查找的是不是：
- DCT變換采取基于FFT(fast Fourier transform)的快速算法，所以，首先尋找整數FFT變換。DCT is based on FFT (Fast Fourier Transform), so integers FFT transform must be structured firstly.
- 整數DCT變換Integer DCT transform
- 變換vary
- 整數(n) integer; whole number
- DCT變換DCT transform
- 變換的transpositional
- 變換器convertor
- 傅里葉變換Fourier transformation
- 整數DCTinteger DCT
- 反DCT變換inverse DCT
- DCT變換域DCT domain
- 整數變換integer transform
- 離散DCT變換discrete DCT
- 整數Z變換integer Z-transformation
- 二維DCT變換2-D DCT transfonn
- 整數小波變換integer wavelet transform
- 整數初等變換integer elementary transformation
- DCT變換編碼DCT transformational code
- 整數余弦變換integer cosine transformation
