登录
首页 » Visual C++ » FDR-COMPRESS

FDR-COMPRESS

于 2009-05-12 发布 文件大小:2KB
0 302
下载积分: 1 下载次数: 10

代码说明:

  一种改进的方案,它针对硬故障集的特点利用指示频率连续长度码(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. )

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

发表评论

0 个回复

  • Erika
    upx解压,演示upx解压的程序源码,仅供参考。(upx unpack,show upx unpack program source code)
    2016-03-25 11:07:12下载
    积分:1
  • cccc
    输入两个正整数m和n,求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)
    2010-05-11 21:19:20下载
    积分:1
  • sitesee
    网规网优之用,用于绘制基站扇区图,地理化显示基站方便工程师进行查看。(Net regulatory network optimization purposes, used to map the base station sector maps, geographic-based display base stations to facilitate engineers to view it.)
    2021-04-20 14:58:50下载
    积分:1
  • haffman
    对输入的字符进行哈弗曼编码,生成编码表,计算压缩比等(haffman tree)
    2011-08-30 14:10:52下载
    积分:1
  • bnpts点云文件bunny
    bnpts点云文件 进过压缩处理 大约100000个点(bnpts)
    2010-11-01 10:57:16下载
    积分:1
  • CST_Cversion
    基于类函数形函数的参数化建模方法,适用于气动设计和优化(Class/Shpae Transform method)
    2020-12-09 16:59:19下载
    积分:1
  • DS4
    设电文字符集D及各字符出现的概率F如下: D={a,b,c,d,e,f,g,h}(字符数n=8) F={5,29,7,8,14,23,3,11}( ) 编写完成下列功能的程序: ①构造关于F的Huffman树; ②求出并打印D总各字符的Huffman编码。 程序结构: 类型说明; 构造Huffman树的函数:Huffman_tree(H[m+1]); 求Huffman编码的函数:Huffman_code(code[n+1]); main() { 变量说明; 输入字符集D及频率F; 调用Huffman_tree(H); 调用Huffman_code(code); 打印编码; Y 继续? N 停止 }
    2015-06-06 16:41:33下载
    积分:1
  • EZW2
    利用零树小波的概念,完成了对静态图像的编码与解码,经过调试的。(The use of the concept of zerotree wavelet completed on the static image encoding and decoding, after debugging.)
    2008-06-26 09:03:38下载
    积分:1
  • The-Hoffman-code
    利用Huffman编码方式对一段文字进行编码和解码。哈夫曼编码是可变字长编码(VLC)的一种。(Using the Huffman encoding method for encoding and decoding of a paragraph of text. Huffman code is a variable length coding (VLC) is a kind of.)
    2015-01-27 15:30:06下载
    积分:1
  • 点云数据的显示 point cloud compression
    pcl 源码 点云数据的压缩显示,压缩数据的算法(display pcl source point cloud data compression algorithm to compress data)
    2012-12-05 19:42:58下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载