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.
FFT是数字信号处理中的一种非常重要的算法，蝶形运算模块是FFT处理其中的重要构造模块。
FFT is a very important algorithm in digital signal processing, and butterfly operation modules are important construction modules in FFT processor.
并对这两种算法进行了比较。最后，得到利用上面的嵌入算法将蝶形网络嵌入环形光网络的嵌入方法并分析了其嵌入拥挤度。
Finally, based on the above algorithm we get the embedding method from the butterfly network to the optical ring network and we analyse the embedding congestion of it.
给出了频域抽取二维向量基快速傅里叶变换算法，针对二维频域信号采用频域抽取方法，导出了该快速算法蝶形运算的一般形式并给出了算法实现流程图。
In accordance with the requirements of high speed digital signal processing, the algorithm of radix-4 implemented with FPGA and the integrated architecture and butterfly unit are analyzed.
给出了频域抽取二维向量基快速傅里叶变换算法，针对二维频域信号采用频域抽取方法，导出了该快速算法蝶形运算的一般形式并给出了算法实现流程图。
In accordance with the requirements of high speed digital signal processing, the algorithm of radix-4 implemented with FPGA and the integrated architecture and butterfly unit are analyzed.
应用推荐