首页> 外文会议>Computer Arithmetic (ARITH), 1975 IEEE 3rd Symposium on >Self-checking adder for large scale integration
【24h】

Self-checking adder for large scale integration

机译:自检加法器,用于大规模集成

获取原文

摘要

The testing of LSI chips is expensive and unsatisfactory. On the other hand there are cases (as in space ship computers) where a damaged chip must be localized and replaced. The use of self-checking chips seems to be one of several possible solutions of this problem. The theory of the structure of self-checking logical circuit is covered by literature at least at the fundamental form (see References). However, even when the design principles are supposed to be known, their application to the actual creation of a self-checking circuit of an average complexity is and will remain an art. The reason is quite simple and fundamental: optimization of design criteria (engineering qualifications, performance and physical properties of components of the circuits are entities possessing different physical dimensions — it is impossible to qualify, for instance, two circuits A, B designed for the same task by comparing their speeds and costs if A is faster than B but B is cheaper than A) will never be objective and independent of the talent or whim of the circuit designer. As an example of the design of a self-checking circuit we present here a binary adder (Full Adder) designed under the following considerations: 1: The adder is composed from gates (AND, 0R, NAND, N0R, …). 2: Two level design was chosen. 3. Ripple carry addition was accepted as sufficient simplification for the design experiment. 4. Only two classes of fault were considered: Stuck at ONE, Stuck at ZERO. 5. Any single fault in the circuit must be signalized either during the activity of the circuit (clock ON) or during a test fault injection (clock OFF). 6. The number of cases where a multiple fault remains undetected must be extremely low in comparison with all possible cases. To obtain an adder with all those requirements the following design idea is used: The adder''s three bit input (X, Y, C) is transformed into an eight bit signal (S1, i = 0, 1, …, 7) by using ONE-FROM EIGHT CODE. This signal, produced by the first level of the circuit, is then transformed by the second level of the circuit into the desired output signal (Z, G) by using four wires and TWO FROM FOUR CODE. Ten fault signals (Fig. 1) are derived from those two codes and checked at the proper state of the clock.
机译:LSI芯片的测试昂贵且不令人满意。另一方面,在某些情况下(例如在太空飞船计算机中),必须对损坏的芯片进行定位和更换。自检芯片的使用似乎是该问题的几种可能解决方案之一。自检逻辑电路的结构理论至少在基本形式上被文献所涵盖(请参见参考资料)。然而,即使假定设计原理是已知的,它们在实际创建具有平均复杂度的自检电路中的应用仍将是一门艺术。原因很简单,也很基础:优化设计标准(电路组件的工程资格,性能和物理特性是具有不同物理尺寸的实体,例如,不可能为同一电路设计两个电路A,B)如果A比B快,但B比A便宜,则通过比较它们的速度和成本来完成这项任务)将永远不会是客观的,并且与电路设计师的才华或心血来潮无关。作为自检电路设计的一个示例,我们在此介绍一种基于以下考虑因素设计的二进制加法器(Full Adder):1:加法器由门(AND,0R,NAND,N0R等)组成。 2:选择了两层设计。 3.纹波进位加法被认为是设计实验的足够简化。 4.仅考虑了两类故障:卡在ONE处,卡在零位处。 5.在电路活动期间(时钟打开)或在注入测试故障(时钟关闭)期间,必须发出电路中任何单个故障的信号。 6.与所有可能的情况相比,仍未检测到多重故障的情况数必须极少。为了获得具有所有这些要求的加法器,使用以下设计思想:加法器的三位输入(X,Y,C)被转换为八位信号(S 1 ,i = 0,1,…,7)使用ONE- 从八码。由电路的第一级产生的该信号随后由电路的第二级通过使用四根导线和两个四码转换为所需的输出信号(Z,G)。从这两个代码中得出十个故障信号(图1),并在时钟的正确状态下进行检查。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号