赫夫曼编译码器(国外英语资料).docVIP

赫夫曼编译码器(国外英语资料) There is such a course design topic [problem description] Using Huffman coding for communication can greatly improve channel utilization, shorten the transmission time and reduce transmission costs. However, this requires the sender to encode the data by a coding system at the sending end and decode the data at the receiver (Fu Yuan). For duplex channels (i.e., channels capable of two-way transmission of information), each end requires a complete codec system. Try writing a Huffman coding / decoding system for such an information transceiver station. [basic requirements] A complete system should have the following functions: (1) I: initialization (Initialization). From the terminal read into the character set size, N, and n characters and N weights, the establishment of Huffman tree, and save it in the file hfmTree. (2) E: encoding (Encoding). Using the built Huffman tree (if not in memory, then read it from the file hfmTree), encode the text in the file ToBeTran, and then put the results in the file CodeFile. (3) D: decoding (Decoding). Huffman tree has been built using the file CodeFile code for decoding, the results stored in the file TextFile. (4) P: printed code file (Print). Display the file CodeFile in a compact format on the terminal, each line of 50 code. At the same time, write the encoded file of this character form into the file CodePrin. (5) T: printing (Tree). The Huffman tree that is already in memory is displayed on the terminal in an intuitive way (tree or indented table form), and at the same time, the Huffman tree in this character is written into the file TreePrint. [test data] (1) use the data in the following question to debug the program. In a communication system, only eight characters may appear, and their probabilities are 0.25, 0.29, 0.07, 0.08, 0.14, 0.23, 0.03, 0.11, respectively, and Huffman coding is attempted. (2) establish the Huffman tree with the actual statistics of the character set and frequency given by the foll