·2,447,543篇论文数据,部分数据来源于NoteExpress
IDCT变换的蝶形算法采用非阻塞赋值的方式实现,并实现块级的流水处理;
Non-blocking assignment method was used to implement the butterfly algorithm of IDCT transform, which is pipelined with blocks.
首先将二维idct转换为两个一维idct变换,根据蝶形算法进一步转换为矩阵的乘加运算。
First, the 2-d IDCT is transformed into two cascaded 1-d IDCT. Then 1-d IDCT can be implemented by multiplication and addition of matrix according to butterfly computation.
本文提出离散余弦变换(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.
应用推荐