基于Huffman編碼的數(shù)據(jù)壓縮算法的研究與實(shí)現(xiàn)

電子通信論文編號(hào):TX046       論文字?jǐn)?shù):19991,頁數(shù):49

目  錄
摘要   
ABSTRACT  

第一章 緒  論   1
1.1數(shù)據(jù)壓縮的意義及發(fā)展   1
1.2 什么是數(shù)據(jù)壓縮   2
1.3 數(shù)據(jù)壓縮的基本原理   2
1.4 數(shù)據(jù)壓縮的分類   3
1.5 數(shù)據(jù)壓縮模型的建立   3
1.6 數(shù)據(jù)壓縮技術(shù)標(biāo)準(zhǔn)   5
本章小結(jié)   5
第二章 無損壓縮基礎(chǔ)   7
2.1信息量和熵   7
2.2無損信源編碼定理   7
2.3 率失真理論   11
本章小結(jié)   12
第三章 Huffman編碼原理及算法   13
3.1哈夫曼編碼簡介   13
3.2 Huffman編碼原理   13
3.3 Huffman編碼算法的實(shí)現(xiàn)   15
3.3.1靜態(tài)Huffman編碼   15
3.3.2 動(dòng)態(tài)Huffman編碼   15
3.3.3 Huffman 編碼的幾種算法   18
3.4 Huffman 編碼的幾個(gè)研究   19
3.4.1大數(shù)據(jù)條件下的溢出問題探討   19
3.4.2 Huffman編碼優(yōu)劣的探討   21
本章小結(jié)   22
第四章 基于Huffman算法的壓縮軟件設(shè)計(jì)   24
4.1模塊的劃分  24
4.2具體設(shè)計(jì)過程   25
4.2.1 界面設(shè)計(jì)   25
4.2.2關(guān)鍵函數(shù)的程序?qū)崿F(xiàn)   27
4.3 軟件壓縮效果分析  31
第五章 結(jié)論   34
參考文獻(xiàn)   35
致  謝   36
附錄  37

摘要
數(shù)據(jù)壓縮技術(shù)是一項(xiàng)重要實(shí)用的信息技術(shù)。信息時(shí)代的到來，信息量迅速增長，使得數(shù)據(jù)壓縮也顯得越來越重要。數(shù)據(jù)壓縮有多種編碼方法，大致可分為無損壓縮編碼和有損壓縮編碼。其中，Huffman 編碼是第一個(gè)實(shí)用的無損壓縮編碼技術(shù)，經(jīng)過了多年的不斷改進(jìn)，已經(jīng)形成了系統(tǒng)的理論和方法。目前主要有兩種類型的Huffman編碼方式，即靜態(tài)Huffman編碼和動(dòng)態(tài)Huffman編碼。Huffman編碼有著廣泛的應(yīng)用，但是不再是壓縮算法的全部，而是被當(dāng)作最終的編碼方法。                    
本文首先介紹了數(shù)據(jù)壓縮的發(fā)展歷史和數(shù)據(jù)壓縮的基本原理，然后介紹了Huffman編碼的原理和算法及其衍生算法，并對(duì)它們進(jìn)行簡單的比較。最后，選用一種較好的Huffman算法，實(shí)現(xiàn)一個(gè)軟件系統(tǒng)。

關(guān)鍵詞: 數(shù)據(jù)壓縮，Huffman編碼,動(dòng)態(tài)Huffman編碼

 ABSTRACT
Data compression is a very important and practical information technology. In the information age, data compression technology becomes more and more important because of the rapid growth of the quantity of information. There are many coding methods of data compression, substantially, can be divided into lossless and lossy compression coding. Huffman coding is the first practical lossy compression coding technology. After many years of continuous improvement, it has formed a system of the theory and method. Currently there are two major types of Huffman coding, static Huffman coding and dynamic Huffman coding. Huffman coding has extensive applications, which is no longer the all of the compression algorithm, but to be the final coding method.
Firstly, this paper introduces the history and basic principles and methods of data compression， then introduces the theory and algorithm of huffman coding and its derivatives algorithms, and compares them simply. Finally, it’s realized a software system based on a better Huffman algorithm.
KEY WORDS:  data compression, Huffman coding, dynamic Huffman coding