2011/07/22 by Fabian Altenbach, Altenbach, Fabian, Georg Böcherer +3
Computer Science · Engineering · Mathematics · #Advanced Data Compression Techniques #Advanced Wireless Communication Techniques #Algorithms and Data Compression #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1107.4500
submitted to ICSPCS 2011, Honolulu
arxiv created 2011/07/22 · openalex publication_date 2011/07/22 · arxiv updated 2011/07/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.