哪位好心人帮我用英语翻译一下下面的计算机文章啊，急用，感激不尽

Huffman coding as a lossless compression method most commonly used in data compression process has a very important application. In this main principle of the Huffman coding algorithm and the basic application of a comprehensive discussion is given for the bmp format image compression and decompression of specific processes and procedures.Huffman coding and with its own characteristics of the algorithm was proposed two improved party ideas, were not dependent on the specification tree and the Huffman compression algorithm based on sub-block in image compression algorithms. Experiments show that, according to the basic Huffman algorithm is substituted into the legend, the legend of each pixel can be calculated Huffman coding and compression ratio, about 79% to the compression purpose. The improved algorithm is the compression and decompression processes than the traditional Huffman compression algorithm is much faster, much less space needed is an effective fast compression algorithm.

Hoffmann coding as one of the most commonly used lossless coding method in data compression programs have very important applications. In this article to hoffmann coding algorithm of principle and basic application fully discussed, in view of BMP format images give a specific compression and uncompress processes and procedures. Combining hoffmann coding the characteristics of the algorithm study, puts forward two improvements ideas, respectively is not dependent on the tree structure of regulating hoffmann yards compression algorithm and sub-block characteristics of image compression algorithm. Experiment proves, according to the basic hoffmann, the algorithm and calculate the illustrations, but each pixel illustration of hoffmann coding and compression ratio, about 79% and reached the compression purpose. Improved algorithm of the whole compression, unzip process than preach ?

Huffman coding as a lossless compression method most commonly used in data compression process has a very important application. In this main principle of the Huffman coding algorithm and the basic application of a comprehensive discussion is given for the bmp format image compression and decompression of specific processes and procedures.Huffman coding and with its own characteristics of the algorithm was proposed two improved party ideas, were not dependent on the specification tree and the Huffman compression algorithm based on sub-block in image compression

Hoffmann coding as one of the most commonly used lossless coding method ,
In data compression programs have very important applications .Hoffmann coding algorithm of principle and basic applications carries on the comprehensive discussion ,For BMP format images give a specific compression and uncompress processes and procedures .Combining hoffmann coding the characteristics of of the algorithm is studied .Proposed two improvements ideas .Do not rely on the tree structure respectively the standard hoffmann yards compression algorithm and sub-block characteristics of image compression algorithm .
Experiments prove ,According to the basic hoffmann ,Algorithm and the illustrations .Can calculate illustrations in each pixel hoffmann coding and compression ratio .Approximately 79%,Reached compression purpose .Improved algorithm of the whole compression ,Required space much less ,It is an effective rapid compression algorithm .

Hoffmann coding as one of the most commonly used lossless coding method in data compression programs have very important applications. In this article to hoffmann coding algorithm of principle and basic application fully discussed, in view of BMP format images give a specific compression and uncompress processes and procedures. Combining hoffmann coding the characteristics of the algorithm study, puts forward two improvements ideas, respectively is not dependent on the tree structure of regulating hoffmann yards compression algorithm and sub-block characteristics of image compression algorithm. Experiment proves, according to the basic hoffmann, the algorithm and calculate the illustrations, but each pixel illustration of hoffmann coding and compression ratio, about 79% and reached the compression purpose. Improved algorithm of the whole compression, unzip process than traditional hoffmann compression algorithm needed much faster, much less space, it is an effective rapid compression algorithm.