| 摘要 |
This disclosure presents techniques for implementing a fast algorithm for implementing odd-type DCTs and DSTs. The techniques include the computation of an odd-type transform on any real-valued sequence of data (e.g., residual values in a video coding process or a block of pixel values of an image coding process) by mapping the odd-type transform to a discrete Fourier transform (DFT). The techniques include a mapping between the real-valued data sequence to an intermediate sequence to be used as an input to a DFT. Using this intermediate sequence, an odd-type transform may be achieved by calculating a DFT of odd size. Fast algorithms for a DFT may be then be used, and as such, the odd-type transform may be calculated in a fast manner
|
