Welcome![Sign In][Sign Up]
Location:
Search - dynamic huffman

Search list

[Compress-Decompress algrithmsLZHUF

Description: 一种无损压缩算法,采用了lzss结合huffman动态编码,速度快-a lossless compression algorithm, using a combination of lzss dynamic Huffman coding, fast
Platform: | Size: 4380 | Author: 任燕 | Hits:

[PropertySheet动态哈夫曼的改进

Description: 来有人提出了一种动态的哈夫曼编码方法。动态哈夫曼编码使用一棵动态变化的哈夫曼树,对第t+1个字符的编码是根据原始数据中前t个字符得到的哈夫曼树来进行的,编码和解码使用相同的初始哈夫曼树,每处理完一个字符,编码和解码使用相同的方法修改哈夫曼树,所以-was raised to a dynamic Huffman coding method. Dynamic Huffman coding using a dynamic changes in the Huffman tree for the first t a character encoding is based on the original data before t characters in the Huffman tree for the encoding and decoding using the same initial Huffman tree, each dealing with a character encoding and decoding using the same side Law Revision Huffman tree.
Platform: | Size: 6463 | Author: wzh | Hits:

[ELanguage动态哈夫曼编码

Description: 动态哈夫曼编码-Dynamic Huffman coding
Platform: | Size: 1604 | Author: 我们 | Hits:

[Mathimatics-Numerical algorithmshuffman_src

Description: I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
Platform: | Size: 7401 | Author: 毛磊 | Hits:

[Compress-Decompress algrithmsLZHUF

Description: 一种无损压缩算法,采用了lzss结合huffman动态编码,速度快-a lossless compression algorithm, using a combination of lzss dynamic Huffman coding, fast
Platform: | Size: 4096 | Author: 任燕 | Hits:

[PropertySheet动态哈夫曼的改进

Description: 来有人提出了一种动态的哈夫曼编码方法。动态哈夫曼编码使用一棵动态变化的哈夫曼树,对第t+1个字符的编码是根据原始数据中前t个字符得到的哈夫曼树来进行的,编码和解码使用相同的初始哈夫曼树,每处理完一个字符,编码和解码使用相同的方法修改哈夫曼树,所以-was raised to a dynamic Huffman coding method. Dynamic Huffman coding using a dynamic changes in the Huffman tree for the first t a character encoding is based on the original data before t characters in the Huffman tree for the encoding and decoding using the same initial Huffman tree, each dealing with a character encoding and decoding using the same side Law Revision Huffman tree.
Platform: | Size: 6144 | Author: wzh | Hits:

[Compress-Decompress algrithmshuffman

Description: 动态建立huffman树 纯语言完成,没有用到stl等工具 结构简单-Dynamic establishment of huffman tree pure language completed, did not use tools such as simple structure stl
Platform: | Size: 894976 | Author: 王坤 | Hits:

[Compress-Decompress algrithmsDynamicHuffman

Description: 动态huffman压缩和解压,c语言,转的-Dynamic huffman compression and decompression, c language, turn
Platform: | Size: 4096 | Author: 王森 | Hits:

[Mathimatics-Numerical algorithmshuffman_src

Description: I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
Platform: | Size: 7168 | Author: 毛磊 | Hits:

[Otherhuffman

Description: huffman 树的创建和实现对元素进行huffman编码,本次试验在程序设计方面较之前次实验容易些,但在尝试用动态申请结构数组空间来设计程序时却没有成功-huffman tree to create and realize huffman coding of elements, the test procedure design easier than the previous experiment, but try to use the dynamic structure of the array of space applications to the design process, they did not succeed
Platform: | Size: 1024 | Author: wang | Hits:

[Graph programDCT_DHC

Description: 动态Huffman编码与静态Huffman编码。Dynamic Huffman coding and static Huffman coding.-Dynamic Huffman encoding and static Huffman coding. Dynamic Huffman coding and static Huffman coding.
Platform: | Size: 236544 | Author: myb | Hits:

[Data structsalgraph_binary_tree_huffmantree

Description: 创建静态,动态的三叉霍夫曼树和编码,有向无环图的创建及拓扑排序,双向循环链表,表达式求值,单链表,集合在一起-Create static and dynamic Huffman tree of the trigeminal and coding, directed acyclic graph creation and topological sort, two-way circulation list, expression evaluation, single-chain, together
Platform: | Size: 11264 | Author: 3230133 | Hits:

[Compress-Decompress algrithmshuffman

Description: 实现文本压缩,huffman动态压缩实现-Text compression, huffman dynamic compression to achieve
Platform: | Size: 5120 | Author: yangfeng | Hits:

[Compress-Decompress algrithmsAHC

Description: Adaptive-Huffman Coding自适应的Huffman压缩与解压缩。 在压缩与解压缩过程中动态地改变Huffman树,和编码。-Adaptive-Huffman Coding Adaptive Huffman compression and decompression. Compression and decompression in the process of changing the dynamic Huffman tree, and coding.
Platform: | Size: 2028544 | Author: star | Hits:

[Compress-Decompress algrithmshuffman

Description: 在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。-Online to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only using a simple C function, such as: memset, memmove, qsort, malloc, realloc and memcpy.
Platform: | Size: 14336 | Author: zhaoyibin | Hits:

[Compress-Decompress algrithmsvitter

Description: This code is adapted from Professor Vitter s article, Design and Analysis of Dynamic Huffman Codes, which appeared in JACM October 1987 author: karl malbrain, karl_m@acm.org
Platform: | Size: 4096 | Author: errtu | Hits:

[VHDL-FPGA-VerilogVHDL_huffman_decoder

Description: This is a Huffman decoder with dynamic Huffcode tables. A Testbench for a jpg file is include.
Platform: | Size: 198656 | Author: PCB | Hits:

[Compress-Decompress algrithmshuffman

Description: 自适应(或动态)哈夫曼算法取消了统计,可在压缩数据时动态调整哈夫曼树,这样可提高速度。因此,哈夫曼编码效率高,运算速度快,实现方式灵活。-Adaptive (or dynamic) Huffman algorithm to cancel the statistics, the data can be dynamically adjusted in the compressed Huffman tree, which can improve speed. Therefore, the Huffman coding efficiency, fast speed, to achieve flexible.
Platform: | Size: 2048 | Author: | Hits:

[VHDL-FPGA-Veriloghuffman

Description: 用verilog硬件语言实现了动态huffman编码,能够压缩字符串文件,展示了硬件的压缩率-Using verilog hardware description language to achieve a dynamic huffman coding to compress the string file, showing the hardware compression rate
Platform: | Size: 3072 | Author: 张龙 | Hits:

[DataMining891710

Description: I ve written some many years ago dynamic Huffman algorithm to()
Platform: | Size: 5120 | Author: IZE$929527 | Hits:
« 12 3 »

CodeBus www.codebus.net