Testability Analysis and Scalable Test Generation for High-Speed Floating-Point Units

High-speed datapaths in microprocessors and embedded processors contain complex floating-point (FP) arithmetic units which have a critical role in the processor's performance. Although the FP units' complex structure consists of classic integer arithmetic components, the embedded components encounter serious testability problems due to their limited accessibility from the FP unit ports and testability loss due to FP unit inherent operations, such as rounding and normalization. In this paper, we analyze the testability problems and present scalable test generation for FP units using as a demonstration vehicle the popular, high-speed, two-path architecture of the most complex unit, the FP adder. The key feature of the presented methodology is the identification of testability conditions that guarantee effective test pattern application and fault propagation for each of the components of the FP adder. The identified test conditions can be utilized with respect to any fault model and are independent of the internal structure and the size of the components. Thus, they can be applied to FP adders of various exponent and significant sizes (single, double, and custom precision), as well as to other types of FP units, which also consist of classic integer arithmetic components similarly interconnected

[1]  Ansi Ieee,et al.  IEEE Standard for Binary Floating Point Arithmetic , 1985 .

[2]  Bernd Becker Efficient Testing of Optimal Time Adders , 1988, IEEE Trans. Computers.

[3]  T. Miyazaki,et al.  A practical approach to instruction-based test generation for functional modules of VLSI processors , 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

[4]  Yervant Zorian,et al.  An Effective Built-In Self-Test Scheme for Parallel Multipliers , 1999, IEEE Trans. Computers.

[5]  Yervant Zorian,et al.  Easily Testable Cellular Carry Lookahead Adders , 2003, J. Electron. Test..

[6]  Rolf Drechsler,et al.  On the generation of area-time optimal testable adders , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Peter W. Cook,et al.  Second-generation RISC floating point with multiply-add fused , 1990 .

[8]  Uwe Sparmann,et al.  Derivation of high quality tests for large heterogeneous circuits: floating-point operations , 1992, [1992] Proceedings The European Conference on Design Automation.

[9]  Peter-Michael Seidel,et al.  Delay-optimized implementation of IEEE floating-point addition , 2004, IEEE Transactions on Computers.

[10]  Paul Michael Farmwald,et al.  On the design of high performance digital arithmetic units , 1981 .

[11]  Marc Tremblay,et al.  UltraSPARC: the next generation superscalar 64-bit SPARC , 1995, Digest of Papers. COMPCON'95. Technologies for the Information Superhighway.

[12]  Janusz Rajski,et al.  Design of random pattern testable floating point adders , 1994, Proceedings of IEEE 3rd Asian Test Symposium (ATS).

[13]  Jack Sklansky,et al.  Conditional-Sum Addition Logic , 1960, IRE Trans. Electron. Comput..

[14]  Yervant Zorian,et al.  An Effective Deterministic BIST Scheme for Shifter/Accumulator Pairs in Datapaths , 2001, J. Electron. Test..

[15]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[16]  Michael J. Flynn,et al.  An improved algorithm for high-speed floating-point addition , 1990 .