Description: 通信的数字化是它能与计算机技术和数字信号处理技术相结合的基础，而实现通信数字化的前提是信源能提供的各种用于传递的消息，例如语音、图像、数据、文字等都必须以数字化形式表示。而信源编码是数字通信系统中的重要组成部分，他是保证信号有效传输的一种重要方式。霍夫曼编码依据字符出现的概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，其优越的性能被广泛使用在数字通信系统中。霍夫曼编码已经成为数据压缩的灵魂算法。本文介绍了无失真编码算法的构造，霍夫曼编码的规则和特点，同时分析了对信源进行优化的方法，最后通过MATLAB仿真来讨论比较二元霍夫曼编码、三元霍夫曼编码以及信源扩展编码的效率，来实现霍夫曼码的优化构造。-The digital communication is it can and computer technology and digital signal processing technology in combination of the base, and realize the digital communication is the premise of source can provide all kinds of used to deliver news, such as voice, video and data and text must take the digital form said. And the source coding digital communication system is the important component, he is to ensure the effective transmission signal is an important way. Huffman coding based on the probability of characters appear to construct different "the average length of the shortest code words, sometimes called the best coding, superior performance is widely used in digital communication system. Huffman coding has become the soul of data compression algorithm. This paper introduces the structure of the encoding algorithm without distortion, Huffman coding rules and characteristics, and analysis of the source of the optimization method, and finally by MATLAB simulation to discuss compares two yu Platform: |
Size: 59392 |
Author:郑华 |
Hits:
Search - text compression by huffman coding matlab