本科（）-基于游程编码数据压缩算法设计与实现毕业设计.doc

本科毕业设计（论文） 基于游程编码数据压缩算法的设计与实现 2013年6月 摘 要 本次毕业设计主要是针对于游程编码数据压缩算法的设计与实现，游程编码非常简单，编码、解码速度快，应用广泛。对于二值图像而言是一种编码方法，对连续的黑、白像素数(游程)以不同的码字进行编码。游程编码是一种简单的非破坏性资料压缩法，其好处是加压缩和解压缩都非常快。其方法是计算连续出现的资料长度压缩之，其缺点是对于不重复的资料反而加大容量。本文主要介绍了游程的原理和实现技术，对游程长度编码技术做了较为全面地。包括游程数据压缩、解压缩过程，并给出了流程图 关键词　游程编码 哈夫曼编码 压缩 Abstract This graduation design is mainly based on run-length coding data compression algorithm design and implementation of run-length coding is very simple, encoding and decoding speed, wide application. Run-length coding is a coding method for binary sequence, is a kind of coding method for binary image, the black and white pixels of continuous (run) in different code code word. Run-length coding is a kind of simple nondestructive data compression method, the advantage is that of compression and decompression are very fast. Its method is to calculate a continuous length of data compression, the downside is to not repeat data instead of increasing capacity. Run-length coding is need a lot of buffer and channel, so the data after the run-length coding in further Huffman encoding has reached more . Source coding is mainly introduced in this paper the classification, the optimal method of coding, Huffman tree, construction methods, and the run-length coding principle and implementation technology, the length of the run-length encoding technology is done more comprehensive research. Including the run-length data compression and decompression process, and gives the flow chart; Huffman data compression and decompression process, chart and flow chart is given and the results. Keywords　Run-length coding Huffman encoding The compression  目 录 摘要 I Abstract II 第1章 绪论 1 1.1 课题背景 1 1.2选题目的、意义 2 1.3主要内容 2 第2章 3 2.1 信源编码 3 2.1.1信源编码简介 3 2.1.2信源编码的理论基础 3 2.1.3信源编码的分类及作用 4 2.2最佳变长编码 4 2.2.1香农编码方法 5 2.2.2费诺编码方法 6 2.2.3哈夫曼编码方法 7 2.3游程编码 15 2.3.1游程长度 15 2.3.2游程编码算法 15 2.3.3游程编码特点 16 2.3.4几种基于游程相关性的数据压缩方案 16 2.4本章小结 19 第3章