H. 264解码器中CAVLC码表查找算法的优化

2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing Pub Date : 2011-10-22 DOI:10.1109/IPTC.2011.27

Da Lu, Guofan Liu, Lingli Zhu

{"title":"H. 264解码器中CAVLC码表查找算法的优化","authors":"Da Lu, Guofan Liu, Lingli Zhu","doi":"10.1109/IPTC.2011.27","DOIUrl":null,"url":null,"abstract":"The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operation of the entropy coding is one of the most time-consuming parts in the decoder. According to the characteristics of two-dimensional code table for CAVLC, a fast algorithm was proposed in H.264 decoder implementation, which enable different strategies to be made respectively based on the Variable Length Codes and the Fixed Length Codes existing in two-dimensional code table for CAVLC. The computer simulation results indicate that the decoding time of the entropy decode algorithm can be decreased by 75.1%-82.7% than the original algorithm in the H.264 reference software.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An Optimization for CAVLC Code Table Lookup Algorithm in H. 264 Decoder\",\"authors\":\"Da Lu, Guofan Liu, Lingli Zhu\",\"doi\":\"10.1109/IPTC.2011.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operation of the entropy coding is one of the most time-consuming parts in the decoder. According to the characteristics of two-dimensional code table for CAVLC, a fast algorithm was proposed in H.264 decoder implementation, which enable different strategies to be made respectively based on the Variable Length Codes and the Fixed Length Codes existing in two-dimensional code table for CAVLC. The computer simulation results indicate that the decoding time of the entropy decode algorithm can be decreased by 75.1%-82.7% than the original algorithm in the H.264 reference software.\",\"PeriodicalId\":388589,\"journal\":{\"name\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPTC.2011.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPTC.2011.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

H.264视频编码标准的计算复杂度是H.263和MPEG-4的两到三倍。其中，熵码的运算是解码器中最耗时的部分之一。针对CAVLC二维码表的特点，在H.264解码器实现中提出了一种快速算法，可以根据CAVLC二维码表中存在的变长码和定长码分别制定不同的策略。计算机仿真结果表明，在H.264参考软件中，熵解码算法的解码时间比原算法缩短了75.1% ~ 82.7%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Optimization for CAVLC Code Table Lookup Algorithm in H. 264 Decoder

The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operation of the entropy coding is one of the most time-consuming parts in the decoder. According to the characteristics of two-dimensional code table for CAVLC, a fast algorithm was proposed in H.264 decoder implementation, which enable different strategies to be made respectively based on the Variable Length Codes and the Fixed Length Codes existing in two-dimensional code table for CAVLC. The computer simulation results indicate that the decoding time of the entropy decode algorithm can be decreased by 75.1%-82.7% than the original algorithm in the H.264 reference software.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing

自引率

0.00%

发文量