数据通信pression算法 [英] Data Compression Algorithms
问题描述
我想知道是否有人有数据通信pression算法列表。我知道，基本上是一无所知数据通信pression，我希望更多地了解不同的算法，看看哪些是最新的，还有待了很多的ASIC的开发。
I was wondering if anyone has a list of data compression algorithms. I know basically nothing about data compression and I was hoping to learn more about different algorithms and see which ones are the newest and have yet to be developed on a lot of ASICs.
我希望能实现数据的COM pression的ASIC是独立数据的进来的类型（音频，视频，图像等）的
I'm hoping to implement a data compression ASIC which is independent of the type of data coming in (audio,video,images,etc.)
如果我的问题是过于开放式的，请让我知道，我会修改。谢谢
If my question is too open ended, please let me know and I'll revise. Thank you
推荐答案
有一吨的COM pression算法在那里。你所需要的就是一种无损COM pression算法。无损玉米pression算法玉米presses数据，使得它可以是DECOM pressed实现之前玉米pression正是给予。与此相反的是一种有损COM pression算法。有损COM pression可以从文件中删除数据。 PNG图像使用无损COM pression，而JPEG图像可以经常做使用有损COM pression。
There are a ton of compression algorithms out there. What you need here is a lossless compression algorithm. A lossless compression algorithm compresses data such that it can be decompressed to achieve exactly what was given before compression. The opposite would be a lossy compression algorithm. Lossy compression can remove data from a file. PNG images use lossless compression while JPEG images can and often do use lossy compression.
一些最广为人知的COM pression算法包括：
Some of the most widely known compression algorithms include:
- RLE
- Huffman
- LZ77
ZIP压缩文件使用Huffman编码和LZ77的组合给予禁食COM pression和DECOM pression时间和相当不错的COM pression比率。
ZIP archives use a combination of Huffman coding and LZ77 to give fast compression and decompression times and reasonably good compression ratios.
LZ77是pretty的多RLE的一般形式，它通常会产生更好的结果。
LZ77 is pretty much a generalized form of RLE and it will often yield much better results.
霍夫曼允许最重复字节重新present最少数量的位。 试想一下，看起来像这样的文本文件：
Huffman allows the most repeating bytes to represent the least number of bits. Imagine a text file that looked like this:
aaaaaaaabbbbbcccdd
一个典型的实现霍夫曼将导致下面的映射：
A typical implementation of Huffman would result in the following map:
Bits Character
0 a
10 b
110 c
1110 d
那么该文件将COM pressed这样：
So the file would be compressed to this:
00000000 10101010 10110110 11011101 11000000
^^^^^
Padding bits required
18字节再往5.当然，该表必须包含在文件中。该算法的工作更好地与更多的数据：P
18 bytes go down to 5. Of course, the table must be included in the file. This algorithm works better with more data :P
亚历克斯·阿兰有对霍夫曼的COM pression算法的一个很好的文章以防维基是不够的。
Alex Allain has a nice article on the Huffman Compression Algorithm in case the Wiki doesn't suffice.
随时要求更多信息。这个主题是pretty的织补宽。
Feel free to ask for more information. This topic is pretty darn wide.
这篇关于数据通信pression算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
