首页 | 本学科首页   官方微博 | 高级检索  
     

任意2n阶列率递增顺序斜变换及其快速算法与应用
引用本文:侯正信,徐妮妮,陈宏,李雪蕾.任意2n阶列率递增顺序斜变换及其快速算法与应用[J].信号处理,2005,21(1):90-94.
作者姓名:侯正信  徐妮妮  陈宏  李雪蕾
作者单位:天津大学电子信息工程学院,天津,300072
基金项目:国家自然科学基金(No.69972031)
摘    要:本文分析了斜变换基矢量按列率递增顺序排列的规律,给出了任意2n阶列率递增顺序斜变换的公式及其快 速算法,使斜变换理论完备化。将该算法应用于图像压缩,其变换域数据的熵接近常用的离散余弦变换,但运算速度较快。 该算法适用于需要高速处理和硬件实现的正交变换场合。

关 键 词:斜变换  列率递增顺序  快速算法
修稿时间:2003年8月11日

Arbitrary 2n Order Slant Transform with Sequency Increment and Its Fast Algorithm and Application
Hou zhengxin Xu Nini Chen Hong Li Xuelei.Arbitrary 2n Order Slant Transform with Sequency Increment and Its Fast Algorithm and Application[J].Signal Processing,2005,21(1):90-94.
Authors:Hou zhengxin Xu Nini Chen Hong Li Xuelei
Abstract:This paper analyses the rule of the base vector alignment in sequency increment for slant transform, gives the equations and the fast algorithm for this kind of slant transform of arbitrary 2n orders, makes the slant transform theory more consummate. Using this algorithm to image compression, the data entropy in transform domain approaches that of the commonly used DCT, but the operation speed is faster. This algorithm is suitable for orthogonal transform where high speed and hardware implementation are required.
Keywords:slant transform  sequency increment  fast algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号