摘要
设计和实现了离散余弦变换 (DCT)的基于提升结构的无乘法快速算法 ,称之为二进制的DCT(binDCT) .它只需移位和加法 .该算法是在基于旋转变换的递归算法基础上设计的 ,将传统的旋转变换相当于 3个提升矩阵乘积减少至2个提升矩阵乘积 ,并且还用到了互换思想 。
Fast multiplierless approximations of the discrete cosine transform(DCT) with the lifting scheme, named the binDCT, which only need shift and addition,was realized. This algorithm was derived from plane rotation-based recursive algorithem, which reduced 3 lifting steps to 2 lifting steps in the plane rotation. What's more, permuted idea was used to cut down the operation quantity.
