检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《上海交通大学学报》1998年第9期1-5,共5页Journal of Shanghai Jiaotong University
摘 要:为提高在TMS320C80上开发H.263全软件解码系统的解码速度,减少片内RAM与片外数据交换,提出了一种可变长解码(VLD)算法.该算法根据C80的高速并行处理能力和只有很小片内存储空间等特点,对VLD码表进行设计.使用该算法,在C80的一个片内RAM中就能存放H.263的所有VLD码表.为与目前较常用的逐位查找解码树方法和RezaH方法比较,对MisAmerican图象序列的70帧图象进行实验,其解码速度是逐位查找解码树方法的2倍,比RezaH方法快9.4%,最终可实现CIF格式的12.5帧/s的解码速率.该方法同样适用于分析中需考虑内存及解码速度的其他系统中.A developed method for variable length code decoding (VLD) is proposed which is used in the wholly software H.263 decoding system by TMS320C80 for improving the decoding speed and reducing the frequency of the data exchange between on chip and off chip memory. Based on the characters of C80——highly processing speed and parallel processing performance but only with limited on chip memory, this method makes a design of VLD table. By this method, all of the H.263's VLD tables can be stored in one on chip RAM of C80. Compared with the common bit detection code tree method and the VLD method proposed by Reza H, the experimental result on 70 frames of Miss America shows that the decoding speed is 1 time higher than that of the bit detection code tree method and 109.4% as high as the method proposed by Reza. The result shows that the whole decoding system's high performance——12.5 frame per second for CIF format can be met. This method is also useful for other systems needed to consider both memory space and processing speed.
关 键 词:图象处理 可变长解码 视频解码 TMS320C80
分 类 号:TN919.8[电子电信—通信与信息系统] TN941.1[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63