<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

An efficient VLC decompression scheme for user-defined coding tables

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

DOI

Abstract

With the increase of information and data types, high-throughput and flexible memory-based VLC decoder is required for user-defined coding tables to achieve higher compression ratio. In this paper, we present a memory-based VLC decoder which is quite suitable for the applications with user-defined tables. By parallel loading data into memories, the coding tables can be changed with much less time. The codeword-boundary prediction algorithm breaks the recursive dependency of decoding procedures. As a result, the VLC decoder can be realized on multi-processor architecture and hence the decoding throughput is enhanced significantly. Additionally, the INDEX-OFFSET symbols that can recover all data with pure VLC codeword and smaller table size are presented. Simulation results show that the combination of the proposed VLC decoder and user-defined table can achieve high decompression rate. As a result, it is quite suitable for high data rate applications with user-defined coding tables, such as MPEG-4.

Description

Keywords

Citation

Endorsement

Review

Supplemented By

Referenced By