登录
首页 » Visual C++ » 263yasuoyuv

263yasuoyuv

于 2008-06-12 发布 文件大小:439KB
0 128
下载积分: 1 下载次数: 2

代码说明:

  263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • lzw_soft
    lzw压缩解压算法源码(The soruce of LZW compression algorithm)
    2020-06-26 13:00:01下载
    积分:1
  • bnpts点云文件bunny
    bnpts点云文件 进过压缩处理 大约100000个点(bnpts)
    2010-11-01 10:57:16下载
    积分:1
  • reliability-assessment
    电力输发电系统可靠性评估程序 解析法 系统数据在压缩包里(Power transmission and generation system reliability evaluation process analytical method system data compression bag)
    2020-09-01 09:28:09下载
    积分:1
  • zip
    压缩与解压缩类;压缩文件至.zip包内,增加文件至.zip包内,及解压缩相关操作。(zip and unzip。)
    2013-10-14 10:16:38下载
    积分:1
  • HuffMan
    哈夫曼编码译码系统,设置发送者和接受者两个功能, 发送者的功能包括: ①输入待传送的字符信息; ②统计字符信息中出现的字符种类数和各字符出现的次数(频率); ②根据字符的种类数和各自出现的次数建立哈夫曼树; ③利用以上哈夫曼树求出各字符的哈夫曼编码; ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括: ①接收发送者传送来的编码信息; ②利用上述哈夫曼树对编码信息进行翻译,即将编码信息还原成发送前的字符信息。 (Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)
    2012-06-21 21:01:17下载
    积分:1
  • MCAB
    简单易用的制作压缩包软件,原著老毛桃。使用简单,压缩时间快(easy to use for make cab)
    2013-10-14 16:30:06下载
    积分:1
  • FDR-COMPRESS
    一种改进的方案,它针对硬故障集的特点利用指示频率连续长度码(FDR码)进行二次编码压缩。该方法充分利用测试集中无关位较多而测试模式之间变化位较少的特征,应用贪心算法对预先计算的测试集进行了重新排序,尽可能的使相邻的向量间具有最少的不同位,排列成一个最佳的差分向量序列,然后应用FDR码对差分向量序列进行编码,最后对压缩结果重新分块,按照一次压缩的流程进行二次压缩。在解压时,使用片上解压电路解压,能高效地还原出原测试集。最后通过对Soc部分标准电路硬故障集的测试结果显示,本方案具有较好的压缩率。(a new improved method was proposed in the paper,the method using Frequency-Directed Run-length(FDR codes)coding for the twice aimed at hard-fault. It fully takes advantage of the characters that there are many don’t-care bits in the test set but a few different bits between the test patterns, Then it applies the greed calculate way to sort the precomputed test sets and make the close together vector have the least different sites possibly. It uses the FDR codes to coding the vectors,then blocks the results and uses the FDR codes to compress for the second time. Decompression used of on-chip circuit extract unpack,it will be deoxidize the original test efficient.using the hard-fault to compress and the experimental results prove that the improved coding method of this paper has the better compression ratios has been proved at last. )
    2009-05-12 14:32:23下载
    积分:1
  • PhucDo_PhanLop
    Docuemtns,Hot Documents
    2009-12-26 14:25:16下载
    积分:1
  • SourceCode
    赫夫曼编/译码器源码,已生成的每个字符的赫夫曼编码,对任意字符文本进行编码,再译码(Huffman encoder/decoder source code, Huffman coding, each character has been generated, the text of any character encoding, decoding)
    2013-04-24 10:36:09下载
    积分:1
  • sdf2samples
    用于开发Windows Mobile的参考源程序(Windows Mobile for the development of a reference source)
    2008-06-30 10:24:17下载
    积分:1
  • 696518资源总数
  • 104347会员总数
  • 12今日下载