Testability analysis and scalable test generation for high-speed floating-point units

被引:4
作者
Xenoulis, George
Psarakis, Mihalis
Gizopoulos, Dimitris
Paschalis, Antonis
机构
[1] Univ Piraeus, Dept Informat, Piraeus 18534, Greece
[2] Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
关键词
test generation; testability conditions; processor testing; datapath testing; floating-point unit testing;
D O I
10.1109/TC.2006.187
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1449 / U24
页数:21
相关论文
共 23 条
  • [1] EFFICIENT TESTING OF OPTIMAL TIME ADDERS
    BECKER, B
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (09) : 1113 - 1121
  • [2] ON THE GENERATION OF AREA-TIME OPTIMAL TESTABLE ADDERS
    BECKER, B
    DRECHSLER, R
    MOLITOR, P
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (09) : 1049 - 1066
  • [3] A REGULAR LAYOUT FOR PARALLEL ADDERS
    BRENT, RP
    KUNG, HT
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (03) : 260 - 264
  • [4] ERCEGOVAC M, 2003, DIGITAL ARITHMETIC, P397
  • [5] FARMWALD P, 1981, THESIS STANFORD U
  • [6] Easily testable cellular carry lookahead adders
    Gizopoulos, D
    Psarakis, M
    Paschalis, A
    Zorian, Y
    [J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2003, 19 (03): : 285 - 298
  • [7] An effective built-in self-test scheme for parallel multipliers
    Gizopoulos, D
    Paschalis, A
    Zorian, Y
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (09) : 936 - 950
  • [8] Gorshtein V.Y, 1998, U.S. Patent, Patent No. [5,808,926, 5808926]
  • [9] GREENE AS, 1995, FORDHAM LAW REV, V64, P451
  • [10] A practical approach to instruction-based test generation for functional modules of VLSI processors
    Hatayama, K
    Hikone, K
    Miyazaki, T
    Yamada, H
    [J]. 15TH IEEE VLSI TEST SYMPOSIUM, PROCEEDINGS, 1997, : 17 - 22