Short Huffman Codes Producing 1s Half of the Time

Authors

F. Altenbach, G. Böcherer, R. Mathar,

Abstract

        The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fair bit stream. However, simple source encoders such as short Huffman codes generate bit streams that poorly match this assumption. As a result, the channel input distribution does not match the original design criteria. In this work, a simple method called half
Huffman coding (HALFHC) is developed. HALFHC transforms a Huffman code into a source code whose output is more similar to a fair bit stream. This is achieved by permuting the codewords such that the frequency of 1s at the output is close to 0.5. The permutations are such that the optimality in terms of achieved compression ratio is preserved. HALFHC is applied in a practical example, and the resulting overall system performs better than when conventional Huffman coding is used.

BibTEX Reference Entry 

@inproceedings{AlBoMa11,
	author = {Fabian Altenbach and Georg B{\"o}cherer and Rudolf Mathar},
	title = "Short Huffman Codes Producing 1s Half of the Time",
	pages = "1-5",
	booktitle = "International Conference on Signal Processing and Communication Systems (ICSPCS'11)",
	address = {Honululu, Hawaii},
	month = Dec,
	year = 2011,
	hsb = hsb999910123227,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.