Fast radix-p discrete cosine transform |
| |
Authors: | Gabriele Steidl |
| |
Affiliation: | (1) FB Mathematik, Universität Rostock, Universitätsplatz 1, 0-2500 Rostock, FRG |
| |
Abstract: | A new fast radix-p-algorithm (p 2) for the discrete cosine transform (DCT) and its inverse is presented. It is based on the divide-and-conquer method and on the arithmetic with Chebyshev polynomials. The algorithm can be applied for the efficient calculation of DCT's of arbitrary transform lengths and for the implementation of other discrete Vandermonde transforms withO(N logN) arithmetical operations. |
| |
Keywords: | Discrete cosine transform Discrete Vandermonde transform Radix-p-algorithm Chebyshev polynomials |
本文献已被 SpringerLink 等数据库收录! |