Efficient encoding and decoding algorithms for variable-length entropy codes

Higgie, G.R. and Fong, A.C.M. (2003) Efficient encoding and decoding algorithms for variable-length entropy codes. IEE Proceedings: Communications, 150(5), p. 305. (doi: 10.1049/ip-com:20030540)

Full text not currently available from Enlighten.

Abstract

Successive versions of the MPEG and JPEG coding standards have been widely adopted for compression of moving pictures and still images. Variable-length codes (VLC) such as Huffman codes are generally employed within the frameworks of these standards to achieve optimal coding efficiency in the entropy coding stage. Conventional table look-up encoding/decoding techniques for VLC are inefficient in memory usage. This is a particularly important consideration for handheld devices, such as cellular phones with image reception and processing capabilities. The authors present a series of efficient and simple algorithms for VLC encoding and decoding based on a pointer look-up approach. They present both software and hardware implementations of these algorithms, and a comparison of memory requirements associated with the pointer look-up and conventional techniques.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Fong, Dr Alvis Cheuk Min
Authors: Higgie, G.R., and Fong, A.C.M.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:IEE Proceedings: Communications
ISSN:1350-2425

University Staff: Request a correction | Enlighten Editors: Update this record