H.26L中整数变换的研究及改进

针对DCT变换存在浮点运算、运算量大等问题,H.26L提出了整数变换,它能够很好地消除浮点运算,避免逆变换不匹配,但存在精度不高的问题。在基于提升结构(liftingstructure)的无乘法二进制DCT(binDCT)的基础上,对参数进行选择优化,并将浮点DCT、整数变换和binDCT在结构和性能上进行比较分析,选择一组binDCT参数,使binDCT既能避免浮点运算又能降低运算量,且更有利于压缩。     

双正交重叠变换的整数实现算法与图像压缩

本文利用提升原理,以二进制整数DCT为基础,提出了双正交重叠变换的整数实现算法,其计算只需要少量的移位和加法运算,因而软件实现和硬件实现都非常简单.实验结果表明,它是一种有效的图像压缩变换,压缩质量大大超过了运算量更多的近似二进制整数小波变换和DCT,与Daubechies 9/7小波也非常接近.     

基于NEDA算法的二维DCT硬件加速器的设计实现

应用二维DCT的图像压缩系统,DCT的运算量较大,为了突破该瓶颈,设计了基于NEDA算法的DCT硬件加速器,该设计方案采用移位相加代替乘法运算,并用RAM代替ROM,有效地节省了硬件资源.给出了Verilog仿真结果,结果表明该加速器可以在使用资源非常少的情况下,正确地实现二维DCT运算,适合于各种视频图像压缩方面的应用.     

基于DCT变换的LSF参数降维算法

为降低声码器线谱对频率(LSF)参数量化码本的存储量和码本搜索运算量,文章提出了一种基于二维DCT变换的LSF参数降维算法.相比时域重要帧抽取算法,DCT降维算法能够在不降低语音听觉性能的基础上,将LSF参数的码本量和搜索运算量都降到50%.在同等情况下,DCT降维算法能比时域重要帧抽取算法提高0.1dB到0.2dB的性能.实验结果表明,提出的算法可以更有效地解决低速率声码器中参数码本存储量和搜索运算量的问题.     

MPEG编码算法的优化

提出了MPEG编码中关键算法的优化方法.MPEG算法是一个非对称的算法,编码算法运算量大、解码运算量小,编码算法中运算量最大的为DCT变换和运动估计.同时视频的数据量是巨大的,对编码中数据流的约束也是必不可少的.以DSP为例,介绍了数据流、DCT交换和运动估计在其上的优化方法.     

H.264整数DCT的硬件实现

该文在分析了H.264整数DCT（Discrete Cosine Transform）变换原理的基础上,介绍了一种实现4×4前向整数变换的新算法。该算法较多地运用了矩阵运算,与传统的将一个二维DCT变换转变为两个一维DCT变换相比,省略了转置模块,降低了时钟延时,减少了资源占用,更利于达到基于H.264的视频信号处理的性能要求。根据新的算法编写了verilog程序并在QuartusⅡ8.0软件中进行了仿真并得出结果。     

H．264整数DCT的FPGA实现

H.264整数DCT变换算法有助于减少计算复杂度,提高编码速度,进一步提高视频或图像的压缩效率。分析H.264整数DCT变换的快速算法及其实现原理,并提出一种用来具体实现一个4×4块的DCT变换的结构;同时给出用VHDL语言实现4×4块DCT变换的内部模块的源代码和仿真波形。仿真结果表明用该算法可快速实现一个4×4块的整数DCT变换。提出一种切实可行的用于H.264整数DCT变换的结构,该结构可完全用硬件电路快速实现;对于用FPGA实现H.264整数DCT变换做了一次实践性的尝试,对深入理解H.264整数DCT变换及其算法的具体实现具有一定的实践意义。     

二维离散余弦变换的一种新的快速算法

本文介绍了二维离散余弦变换(DCT)的一种新的快速算法。对于NN DCT(N=2m),只需用N个一维DCT和若干加法运算。与常规的行-列法相比,所需的乘法运算量减少了一半,也比其它的快速算法的乘法运算量要少,而加法运算量基本上是相同的。     

基于JPEG标准的图像压缩DCT变换

图像DCT变换是图像压缩的一项重要技术,如何准确、快速地进行图像压缩一直是国内外研究的热点.现研究了两种二维离散余弦变换(DCT)的方法.在DCT算法结构上利用了变换的可分离性和行列的可分解性,并采用行列分解的方法将二维DCT转换为2个串行的一维DCT实现.     

基于DCT的实值离散Gabor变换

该文提出了一种基于离散余弦变换(DCT)的实值离散Gabor变换(RDGT),不仅适用于临界抽样条件而且适用于过抽样条件,并证明了变换的完备性条件。由于这种变换仅涉及实值计算,并且可利用快速DCT,IDCT算法来加速运算,因此比传统复值离散Gabor变换在计算和实现方面更为简单,必将有效地提高非平稳信号与图像的分析、处理速度和效率。     

压缩域运动补偿中的快速算法研究

研究了压缩域运动补偿的快速算法，着重从数学表达方式上研究了当进行宏块预测时，充分利用参考帧中公共块的计算方法，与DCT矩阵分解的快速算法相比，在不影响图像质量的同时。其计算效率提高了26．5％。     

任意长离散余弦变换的快速递归算法

该文基于Clenshaw递归公式以及离散余弦自身的对称性提出任意长离散余弦变换(DCT)的一种并行递归快速算法,给出了该算法的滤波器实现结构;与现有的其它递归算法以及基于算术傅里叶变换的余弦变换算法进行了计算复杂度的比较分析,结果表明该文算法运算量大大减少。该递归计算的滤波器结构使算法非常适合大规模集成电路(VLSI)实现。     

Skew-circular/circular correlation decomposition of prime-factorDCT

An algorithm to decompose the prime-factor DCT into skew-circular/circular correlation (SCC/CC) by coset decomposition is proposed. The simplest case is when the two factors are odd and relatively prime. In this case, the DCT output components are split into six subgroups. Each subgroup contains three short-length CC or SCC matrix-vector products, and the three products can further be merged into only one short-length SCC or CC matrix-vector product. The six subgroups are independent, thus parallel computing is feasible. By fast computation of the short-length SCC and CC, this algorithm reaches the same or less number of multiplications compared to other efficient prime-factor algorithms     

A fast 4×4 DCT algorithm for the recursive 2-D DCT

The authors present an efficient algorithm for the computation of the 4×4 discrete cosine transform (DCT). The algorithm is based on the decomposition of the 4×4 DCT into four 4-point 1-D DCTs. Thus, only 1-D transformations and some additions are required. It is shown that the proposed algorithm requires only 16 multiplications, which is half the number needed for the conventional row-column method. Since the 2^m×2^m DCT can be computed using the 4×4 DCT recursively for any m, the proposed algorithm leads to a fast algorithm for the computation of the 2-D DCT     

Mixed-radix discrete cosine transform

Presents two new fast discrete cosine transform computation algorithms: a radix-3 and a radix-6 algorithm. These two new algorithms are superior to the conventional radix-3 algorithm as they (i) require less computational complexity in terms of the number of multiplications per point, (ii) provide a wider choice of the sequence length for which the DCT can be realized and, (iii) support the prime factor-decomposed computation algorithm to realize the 2^m3ⁿ-point DCT. Furthermore, a mixed-radix algorithm is also proposed such that an optimal performance can be achieved by applying the proposed radix-3 and radix-6 and the well-developed radix-2 decomposition techniques in a proper sequence     

用超长指令实现DCT的新算法

本文介绍一种新的DCT计算方法,它以现有的DCT快速算法为基础,利用超长指令的并行特征来提高DCT计算的性能.仿真结果表明:该方法的运算速度比普通的DCT计算方法提高73%,即便同快速算法相比,也可以提高24%的运算速度.     

NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM

In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT's and additions, instead of using 2N 1-D DCT's as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.     

Novel DCT-Based Real-Valued Discrete Gabor Transform and Its Fast Algorithms

The oversampled Gabor transform is more effective than the critically sampled one in many applications. The biorthogonality relationship between the analysis window and the synthesis window of the Gabor transform represents the completeness condition. However, the traditional discrete cosine transform (DCT)-based real-valued discrete Gabor transform (RGDT) is available only in the critically sampled case and its biorthogonality relationship for the transform has not been unveiled. To bridge these important gaps, this paper proposes a novel DCT-based RDGT, which can be applied in both the critically sampled case and the oversampled case, and their biorthogonality relationships can be derived. The proposed DCT-based RDGT involves only real operations and can utilize fast DCT algorithms for computation, which facilitates computation and implementation by hardware or software as compared to that of the traditional complex-valued discrete Gabor transform. This paper also develops block time-recursive algorithms for the efficient and fast computation of the RDGT and its inverse transform. Unified parallel lattice structures for the implementation of these algorithms are presented. Computational complexity analysis and comparisons have shown that the proposed algorithms provide a more efficient and faster approach for discrete Gabor transforms as compared to those of the existing discrete Gabor transform algorithms. In addition, an application in the noise reduction of the nuclear magnetic resonance free induction decay signals is presented to show the efficiency of the proposed RDGT for time-frequency analysis.      

H.264中的整数DCT及其蝶形算法

H.264是应用非常广泛的视频图像编码标准.其频域图像预处理采用的是基于4×4图像块的整数DCT.研究了如何由4×4浮点DCT得到4×4整数DCT,并设计了4×4整数DCT的蝶形算法,比较了蝶形算法与普通算法的运算量.