A New Coeff-Token Decoding Method based on the Reconstructed Variable Length Code Table 


Vol. 32,  No. 3, pp. 249-255, Mar.  2007


PDF
  Abstract

In general, a large amount of the memory accesses are required for the CAVLC decoding in H.264/AVC. It is a serious problem for the applications such as a DMB and videophone services because the considerable power is consumed for accessing the memory. In order to solve this problem, we propose an efficient decoding method for the coeff-token which is one of the syntax elements of CAVLC. In this paper, the variable length code table is re-designed with the new codewords which are defined by investigating the architecture of the conventional codeword for the coeff_token element. A new coeff_token decoding method is developed based on the suggested table. The simulation results show that the proposed algorithm achieves an approximately 85% memory access saving without video-quality degradation, compared to the conventional CAVLC decoding.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Moon, "A New Coeff-Token Decoding Method based on the Reconstructed Variable Length Code Table," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 249-255, 2007. DOI: .

[ACM Style]

Yong-ho Moon. 2007. A New Coeff-Token Decoding Method based on the Reconstructed Variable Length Code Table. The Journal of Korean Institute of Communications and Information Sciences, 32, 3, (2007), 249-255. DOI: .

[KICS Style]

Yong-ho Moon, "A New Coeff-Token Decoding Method based on the Reconstructed Variable Length Code Table," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 249-255, 3. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880