本文提出离散余弦变换(DCT)的一种新的快速算法,其特点是变换长度任意,而且采用蝶形结构。
In this paper, a new fast algorithm to calculate discrete cosine transform (DCT) with arbitrary length by means of the butterfly structure is presented.
表 5 提供了所有字符变换测评的计时结果,使用了 480 项计划长度。
Table 5 provides the timing results for all mutation benchmarks, using 480-item plan lengths.
图案的变换说明直角臂的相对长度发生了变化。
Any shift in the position of those regions tells you that the relative lengths of the arms has changed.
应用推荐