| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Testability Analysis and Scalable Test Generation for High-Speed Floating-Point Units
November 2006 (vol. 55 no. 11)
pp. 1449-1457
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 significand 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] 1449 N. Quach and M. Flynn, “An Improved Algorithm for High-Speed Floating-Point Addition,” Technical Report CSL-TR-90-442, Stanford Univ., 1990.[2] P. Seidel and G. Even, “Delay Optimized Implementation of IEEE Floating-Point Addition,” IEEE Trans. Computers, vol. 53, no. 2, pp.97-113, Feb. 2004.[3] D. Greenley, “UltraSparc: The Next Generation Superscalar 64-Bit SPARC,” Proc. Compcon, pp. 442-451, 1995.[4] S. Oberman, “Floating-Point Arithmetic Unit Including an Efficient Close Data Path,” US Patent 6 094 668, 2000.[5] V. Gorshtein, A. Grushin, and S. Shevtsov, “Floating Point Addition Methods and Apparatus,” US Patent 5 808 926, Sun Microsystems, 1998.[6] P.M. Farmwald, “On the Design of High Performance Digital Arithmetic Units,” PhD dissertation, Stanford Univ., 1981.[7] M. Ercegovac and T. Lang, Digital Arithmetic, chapter 8, pp. 397-434. Morgan Kaufmann, 2003.[8] J. Rajski and J. Tyszer, “Design of Random Pattern Testable Floating Point Adders,” Proc. Third Asian Test Symp., pp. 227-232, 1994.[9] U. Sparmann, “Derivation of High Quality Tests for Large Heterogeneous Circuits: Floating-Point operations,” Proc. Third European Conf. Design Automation, pp. 355-360, 1992.[10] K. Hatayama, K. Hikone, T. Miyazaki, and H. Yamada, “A Practical Approach to Instruction-Based Test Generation for Functional Modules of VLSI Processors,” Proc. 15th VLSI Test Symp., pp. 17-22, 1997.[11] B. Becker, R. Drechsler, and P. Molitor, “On the Generation of Area-Time Optimal Testable Adders,” IEEE Trans. Computer-Aided Design, vol. 14, pp. 1049-1066, 1995.[12] D. Gizopoulos, M. Psarakis, A. Paschalis, and Y. Zorian, “Easily Testable Cellular Carry Lookahead Adders,” J. Electronic Testing: Theory and Applications (JETTA), vol. 19, pp.285-298, 2003.[13] D. Gizopoulos, A. Paschalis, and Y. Zorian, “An Effective Built-In Self-Test Scheme for Parallel Multipliers,” IEEE Trans. Computers, vol. 48, no. 9, pp. 936-950, Sept. 1999.[14] “IEEE Standard for Binary Floating Point Arithmetic” 1985.[15] “Floating-Point Adder Generator,” http://www.hmc.edu/chipsfpadd.html, 2006.[16] “Floating-Point Multiplier Generator,” http://www.hmc.edu/chipsfpmul.html, 2006.[17] Supplemental material, http://computer.org/tcarchives.htm, 2006.[18] E. Hokenek, R. Montoye, and P. Cook, “Second-Generation RISC Floating Point with Multiply-Add Fused,” IEEE J. Solid-State Circuits, vol. 25, pp. 1207-1213, 1990.[19] FP-Library http://perso.ens-lyon.fr/jeremie.detrey/ FPLibraryindex.html, 2006.[20] R. Brent and H. Kung, “A Regular Layout for Parallel Adders,” IEEE Trans. Computers, vol. 31, pp. 260-264, 1982.[21] J. Sklansky, “Conditional Sum Addition Logic,” IEEE Trans. Electronic Computers, vol. 9, no. 6, pp. 226-231, June 1960.[22] B. Becker, “Efficient Testing of Optimal Time Adders,” IEEE Trans. Computers, vol. 37, pp. 1113-1121, 1988.[23] N. Kranitis, M. Psarakis, D. Gizopoulos, A. Paschalis, and Y. Zorian, “An Effective Deterministic BIST Scheme for Shifter/Accumulator Pairs in Datapaths,” J. Electronic Testing: Theory and Applications (JETTA), vol. 17, pp. 97-107, 2001.
Index Terms:
Test generation, testability conditions, processor testing, datapath testing, floating-point unit testing.
Citation:
George Xenoulis, Mihalis Psarakis, Dimitris Gizopoulos, Antonis Paschalis, "Testability Analysis and Scalable Test Generation for High-Speed Floating-Point Units," IEEE Transactions on Computers, vol. 55, no. 11, pp. 1449-1457, Nov. 2006, doi:10.1109/TC.2006.187
