Lossless Frame Memory Recompression for Video Codec Preserving Random Accessibility of Coding Unit

Cited 16 time in webofscience Cited 0 time in scopus
  • Hit : 397
  • Download : 0
In recent video applications such as MPEG or H.264/AVC, the bandwidth requirement for frame memory has become one of the most critical problems. Compressing pixel data before storing in off-chip frame memory is required to alleviate this problem. In this paper, we propose a lossless Frame memory recompression scheme including 1) a lossless pixel compression algorithm, 2) an efficient address table organization method for random accessibility, and 3) frame memory placement scheme for compressed data to reduce the effective access time of SDRAM by suppressing row switching. Experimental results show that the proposed method reduces the frame data to 48% compared to that of the uncompressed one with H.264/AVC high profile encoder system, where 610 of SRAM is required for the address table of full HD video.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2009-11
Language
English
Article Type
Article
Keywords

COMPRESSION; H.264/AVC; REDUCTION; DECODERS

Citation

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, v.55, pp.2105 - 2113

ISSN
0098-3063
DOI
10.1109/TCE.2009.5373775
URI
http://hdl.handle.net/10203/96800
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 16 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0