A Fast and Simple Algorithm for the Construction of Asymmetrical Reversible Variable Length Codes

✍ Scribed by Hsien-Wen Tseng; Chin-Chen Chang

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 147 KB
• Volume: 9
• Category: Article
• ISSN: 1077-2014
• DOI: 10.1016/s1077-2014(02)00113-4

✦ Synopsis

Reversible variable length codes (RVLCs) have been used to enhance the error-resilient capability of variable length codes (VLCs). A fast and simple new algorithm that can be used to construct asymmetrical RVLCs is to be proposed here. It generates asymmetrical RVLCs by means of extending the leaf nodes of the Huffman tree. The proposed algorithm proves to be extremely efficient and fast; meanwhile, the maximum code length provided by the proposed algorithm is shorter than those of previous methods. Our new algorithm can apply to any Huffman-based coding scheme to enhance the error-resilient capability, especially when the applications are time-critical, such as wireless systems. The experimental results have shown that our algorithm can generate asymmetrical RVLCs efficiently.