【数据通信与网络】Lecture7-MultiplexingAndDataCompression精品.pptVIP

7.1 FDM 7.2 WDM 7.3 TDM Data Compression 7.5 Huffman code Application: Voice compression Summary  About Compression Techniques Whole Huffman Algorithm (1) Assign one node for each character and assign the character’s frequency to the node that is called the node’s weight（权）. (2) Look for two lightest-weight nodes and merge them into a bintree(二叉树) with a new root node. If there are more lightest-weight nodes , choose randomly. (3) Repeat the previous step and get multiple-level bintree until just one tree is left. (4) From the root to a leaf, assigning a 0 for a left child and a 1 for right child each time. Step by step. Universal Compression Encoding—— Run-length Encoding Relative Encoding Lempel-Ziv Encoding 7.6. Universal Compression Encoding It can compress any bit strings (1) Run-length Encoding (行程编码) Approach It analyzes bit strings and look for continuous 0 or 1. Instead of sending all the bits, it sends only how many are each sequence. Application Very suitable for where there are many long runs of 0s(or 1s), such as fax transmission. Example Suppose four bits are used to represent the run length. Process of Run-length Encoding Code Principle: There is only slight differences between a frame and follow one sometime (such as video images). Just transmitting the differences between a frame and its previous one，called differential encoding (差分编码). Application： Best suit for video images Example 0 means information do not change, so there are long strings of 0s possibly. Continue to use run-length encoding based on the above. (2) Relative Encoding (相对编码) Process of Relative Encoding (3) Lempel-Ziv Encoding —— Compression algorithms based on dictionary Code Principle: In text files and voice, many words or phrases may be repeated. Look for often-repeated strings, replace them with corresponding co