ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술대회 Low Latency Variable Length Coding Scheme for Frame Memory Recompression
Cited 7 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
이상헌, 엄낙웅, 정무경, 경충민
International Conference on Multimedia and Expo (ICME) 2010, pp.232-237
10MB1900, MPCore 플랫폼 기반 다중 포맷 멀티미디어 SoC, 엄낙웅
In frame memory recompression, decompression latency consists of two components, i.e., memory access cycles for compressed data fetch, and decompression time. Compared to most earlier works which mainly focused on the compression ratio and, therefore, only reducing memory access cycles, this paper proposes a low-latency variable-length coding method called non-zero bit selection scheme (NBS). The proposed NBS enables highly parallel decompression achieving a three-cycle decompression for an 8x8 block, compared to previous methods requiring as many as twelve clock cycles for the case of exponential Golomb code. It is notable that the proposed NBS scheme has achieved this without deterioration of the compression ratio. Experimental result on a number of full HD videos shows that the compression ratio of the proposed method is at least not worse than that obtained with the exponential Golomb code on the average, while reducing the decompression time to 25% compared to the exponential Golomb code. © 2010 IEEE.
KSP 제안 키워드
Bit selection, Coding method, Compressed data, Data Fetch, Decompression time, Experimental Result, Frame memory, Golomb code, Highly parallel, Low latency, Memory Access