期刊文献+

基于LFSR状态相关的测试数据压缩方法

Test data compression based on LFSR state correlativity
在线阅读 下载PDF
导出
摘要 针对当前LFSR状态和种子的相关性,控制位在改变当前LFSR状态中相应位的值时,对该种子载入过程中需要改变的位进行控制,使得在生成载入种子测试向量时,不需要全部载入种子的全部位数值,从而使控制简单且种子的施加时间更短,实现测试数据压缩。通过实验证明,该方法能够有效地减少种子的存储空间和施加时间。 As the correlativity between current LFSR state and some seed, the proposed scheme changes the corresponding bits of current state of LFSR by control bits, and controls the bits that need to be changed in the seed loading process, and makes it unnecessary to load all values of the seed while loading seed to generate test vector. The scheme makes the controls simple and less time to load seeds for test data compression. The results of experiments have proved that this scheme has the advantages of reducing the storage and the time of seed applying.
出处 《微型机与应用》 2010年第6期63-66,共4页 Microcomputer & Its Applications
基金 国家自然科学基金重点项目(60633060) 国家自然科学基金(60876028) 教育部博士点基金(200803590006) 安徽省海外高层次人才基金(2008Z014)
关键词 测试数据压缩 线性反馈移位寄存器 重新播种 test data compression linear feedback shift register re-seeding
  • 相关文献

参考文献9

  • 1MOURAD S.Principle of testing electronic system[M].John Wiley & Sons, Inc, 2000.
  • 2梁华国,聚贝勒.海伦布昂特,汉斯-耶西姆.冯特利希.一种基于折叠计数器重新播种的确定自测试方案[J].计算机研究与发展,2001,38(8):931-938. 被引量:44
  • 3HELLEBRAND S, RAJSKI J,TARNICK S, et al.Buih-in test for circuits with scan based on reseeding of muhiplepolynomial linear feedback shift registers[J].IEEE Trans on Comp, 1995,44(2) : 223-233.
  • 4KOENEMANN B.LFSR-coded test patterns for scan designs [C].Proceedings of the european test conference.Munich, germany, 1991 : 237-242.
  • 5梁华国,蒋翠云.使用双重种子压缩的混合模式自测试[J].计算机研究与发展,2004,41(1):214-220. 被引量:38
  • 6ABRAMOVICI M,BREUER M,FRIEDMAN A.Digital systems testing and testable design[M].New York:Computer Science Press, 1990.
  • 7GREGORY G, ABRAHAM P.The traveling salesman problem and its variations[M].Dordrecht Hardbound:Kluwer Academic Publishers, 2002.
  • 8KOENEMANN B, BARNHART C, KELLER B ,et al.A smart BIST variant with guaranteed encoding[C].Proceedings of VLSI test symposium, Marina Del Rey, CA, 2001 : 325- 330.
  • 9WURTENBERGER A ,TAUTERMANN C S ,HELLEBRAND S.A hybrid coding strategy for optimized test data compression[C].Proceedings of IEEE International test conference, Charlotte, NC, 2003 : 451-459.

二级参考文献22

  • 1[1]M Abramovici, M Breuer, A Friedman. Digital Systems Testing and Testable Design. New York: Computer Science Press, 1990
  • 2[2]K-T Chen, C-J Lin. Timing driven test point insertion for full-scan and partial-scan BIST. The IEEE Int'l Test Conf, Washington, D C, 1995
  • 3[3]Y Savaria, M Yousef, B Kaminska .et al.. Automatic test point insertion for pseudo-random testing. The Int'l Symp on Circuits and Systems, 1991. http://ieeexplore.ieee.org/Xplore/DynWel.jsp
  • 4[4]M J Y Williams, J B Angell. Enhancing testability of large-scale integrated circuits via test points and additional logic. IEEE Trans on Computers, 1973, C-22(1): 46~60
  • 5[5]K Chakrabarty, B T Murray, V Iyengar. Built-in test pattern generation for high-performance circuits using twisted-ring counters. The 17th IEEE VLSI Test Symp, Dana Point, CA, 1999
  • 6[6]K Chakrabarty, S Swaminathan. Built-in self testing of high-performance circuits using twisted-ring counters. The 2000 IEEE Int'l Symp on Circuits and Systems, 2000. http://ieeexplore.ieee.org/Xplore/DynWel.jsp
  • 7[7]C Dufaza, G Cambon. LFSR based deterministic and pseudo-random test pattern generator structures. European Test Conference, Munich, 1991
  • 8[8]S Hellebrand, J Rajski, S Tarnick .et al.. Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. IEEE Trans on Computers, 1995, 44(2): 223~233
  • 9[9]S Hellebrand, B Reeb, S Tarnick .et al.. Pattern generation for a deterministic BIST scheme. IEEE/ACM Int'l Conf on CAD-95, San Jose, CA, 1995
  • 10[10]S Hellebrand, H-J Wunderlich, A Hertwig. Mixed-mode BIST using embedded processors. Journal of Electronic Testing Theory and Applications (JETTA), 1998, 12(1/2): 127~138

共引文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部