节点文献

基于单元故障模型的树型加法器的测试

Testing of Tree Adder Based on Cell Fault Model

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李兆麟盛世敏吉利久王阳元

【Author】 LI Zhao-Lin 1) SHENG Shi-Min 2) JI Li-Jiu 2) WANG Yang-Yuan 2) 1)(Institute of High Performance Computing, Department of Computer Science and Technology, Tsinghua University, Beijing 100084) 2)(Institute of Microelectronics, Peking University, Beijing 100871)

【机构】 清华大学计算机科学与技术系高性能研究所北京大学微电子学研究所北京大学微电子学研究所 北京100084北京100871北京100871

【摘要】 首先分析了树型加法器的原理 ,总结了其运算特性 .其次在介绍单元故障模型的基础上分析了树型加法器的测试向量生成 .分析结果表明 ,5n - 1个测试向量可以实现树型加法器中所有单元故障的检测 .这些测试向量具有很好的规则性 ,能够利用片上测试向量生成器实现 ,适合于应用内建自测试技术测试 .基于此 ,作者提出了一种内建自测试的测试结构 ,测试时只需存储 7个籽测试向量 ,其它测试向量可以在这 7个籽测试向量的基础上通过循环移位实现 .最后给出了实验分析结果 .

【Abstract】 Based on cell fault model, the paper studies test pattern generation and self test of tree adder, which is frequently used in the high performance processors. Firstly, the paper analyzes the tree adder’s principle and concludes its properties. Secondly, based on the introduction of cell fault model, which is fit for the testing of regular circuits, the paper presents a complete solution to tree adder testing. In conclusion, 5 n -1 test patterns are enough to exhaustively test all detectable cell faults and any modification of tree adder is not required. Experiment results show that these patterns can guarantee that all cell faults are tested. These patterns have high regularity and can be effectively produced on-chip as required for BIST. Furthermore, a kind of test structure suited for BIST is presented in the paper. When testing, only 7 seed patterns are memorized and all other test patterns can be realized by loop shifting.

【基金】 国家“八六三”高技术研究发展计划重点项目 ( 2 0 0 2AA1Z0 3 0 );国家自然科学基金 ( 60 10 60 0 4)资助
  • 【文献出处】 计算机学报 ,Chinese Journal of Computers , 编辑部邮箱 ,2003年11期
  • 【分类号】TN407
  • 【被引频次】12
  • 【下载频次】141
节点文献中: 

本文链接的文献网络图示:

本文的引文网络