JSW 2014 Vol.9(2): 329-335 ISSN: 1796-217X
doi: 10.4304/jsw.9.2.329-335
doi: 10.4304/jsw.9.2.329-335
A High Efficient Tables Look-up Algorithm for CAVLC Decoding
Jianhua Wang, Lianglun Cheng, Jun Liu, ShiLiang Luo
Faculty of Automation, Guangdong University of Technology, P. R. China
Abstract—In order to solve the problems of high table memory access and long table look-up time and big table storage space in the process of CAVLC decoding for H.264/AVC, a high efficient table look-up algorithm is presented in this paper. The contribution of this paper lies that we uses a program method to realize fully the no-table looking-up of codeword. Specifically, after finding the relationships existed in code length and numbers of 0 in code prefix and code suffix and code, we uses a program code method to realize entirely UVLCTs(Unstructured Variable Length Coding Tables) in CAVLC decoding, As a result, all decoded codewords in UVLCTS can be decoded and obtained easily through a program execution way instead of TLSS(table look-up by sequential search), which could save a lot of table memory access and reduce amount of table look-up time and save a large number of table storage spaces for CAVLC decoding. The simulation results show that our proposed scheme can save 100% table memory access, reduce about 45% table look-up time and save 2320 byte table storage space of table look-up in CAVLC decoding compared with TLSS method, without degrading video quality.
Index Terms—Memory access; Table look-up; Storage space; CAVLC decoding; Program method
Abstract—In order to solve the problems of high table memory access and long table look-up time and big table storage space in the process of CAVLC decoding for H.264/AVC, a high efficient table look-up algorithm is presented in this paper. The contribution of this paper lies that we uses a program method to realize fully the no-table looking-up of codeword. Specifically, after finding the relationships existed in code length and numbers of 0 in code prefix and code suffix and code, we uses a program code method to realize entirely UVLCTs(Unstructured Variable Length Coding Tables) in CAVLC decoding, As a result, all decoded codewords in UVLCTS can be decoded and obtained easily through a program execution way instead of TLSS(table look-up by sequential search), which could save a lot of table memory access and reduce amount of table look-up time and save a large number of table storage spaces for CAVLC decoding. The simulation results show that our proposed scheme can save 100% table memory access, reduce about 45% table look-up time and save 2320 byte table storage space of table look-up in CAVLC decoding compared with TLSS method, without degrading video quality.
Index Terms—Memory access; Table look-up; Storage space; CAVLC decoding; Program method
Cite: Jianhua Wang, Lianglun Cheng, Jun Liu, ShiLiang Luo, "A High Efficient Tables Look-up Algorithm for CAVLC Decoding," Journal of Software vol. 9, no. 2, pp. 329-335, 2014.
General Information
ISSN: 1796-217X (Online)
Frequency: Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKI, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
-
Apr 26, 2021 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Nov 18, 2021 News!
Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP [Click]
-
Dec 24, 2021 News!
Vol 15, No 1- Vol 15, No 6 has been indexed by IET-(Inspec) [Click]
-
Nov 02, 2023 News!
Vol 18, No 4 has been published with online version [Click]
-
Dec 06, 2019 News!
Vol 14, No 1- Vol 14, No 4 has been indexed by EI (Inspec) [Click]