cis 4930 digital circuit testing design for testability
play

CIS 4930 Digital Circuit Testing Design For Testability Dr. Hao - PowerPoint PPT Presentation

CIS 4930 Digital Circuit Testing Design For Testability Dr. Hao Zheng Comp Sci & Eng Univ of South Florida Introduction Testing cost Test gen., fault sim., test equipment, test process (fault detection and location), etc


  1. CIS 4930 Digital Circuit Testing Design For Testability Dr. Hao Zheng Comp Sci & Eng Univ of South Florida

  2. Introduction • Testing cost – Test gen., fault sim., test equipment, test process (fault detection and location), etc • Testing should be considering during the design process – enhances “testability” & design quality – reduces test cost • Test complexity determined by three factors – Controllability – Observability – Predictability – ability to obtain know outputs • Design for Testability (DFT) techniques are design efforts to ensure that a device is testable 9.1 Testability 2

  3. Introduction • Testing cost – Test gen., fault sim., test equipment, test process (fault detection and location), etc • Testing should be considering during the design process • Design for testability (DFT) modifies design to – enhances “testability” & design quality – reduces test cost • Testability involves – Controllability – Observability – Predictability – ability to obtain know outputs 9.1 Testability 3

  4. Testability - Controllability • Controllability – ability to establish a specific signal value at each node in the circuit by setting values on PIs • Circuits difficult to control: – Decoders – Circuits with feedback – Oscillators – Clock generators – Counters (eg., 16 bit counter, how clock cycles will it take to force MSB to 1?) 9.1 Testability 4

  5. Testability - Observability • Observability – Ability to determine the signal value at any node in a circuit by controlling circuit’s inputs and observing its outputs • Circuits difficult to observe: – Sequential circuits – Circuits with global feedback – Embedded RAMs, ROMs, or PLAs – Circuits with redundant nodes 9.1 Testability 5

  6. Some General Observations • Sequential logic is more difficult to test than combinational logic • Control logic is more difficult to test than data- path logic • Random logic is more difficult to test than structured, bus-oriented designs • Asynchronous designs is more difficult to test than synchronous designs 9.1 Testability 6

  7. Tradeoffs • DFT techniques often reduce costs to test. – Improved controllability and observability. – Reduced test time, test generation cost, – improved test quality -> product quality • At meantime, they increase product cost. – Silicon area, I/O pins, power consumption, and circuit delay. • Need to balance gain from DFT and its cost 9.1 Testability 7

  8. Ad Hoc DFT Techniques 1. Test Points 2. Initialization 3. Monostable multivibrators (one-shots) 4. Oscillators and clocks 5. Counters/Shift Registers 6. Partitioning Large Circuits 7. Logical Redundancy 8. Breaking Global Feedback Paths 9.2 Ad Hoc DFT Techniques 8

  9. 1 – Test Points Employ test points to enhance controllability and observability Two types of test points: • Control points (CP) = PIs used to enhance controllability • Observation points (OP) = POs used to enhance observability 9.2 Ad Hoc DFT Techniques 9

  10. Employing Test Points A is an OP A’ is a CP 0 Injection Ckt Demand of large # of IO pins! 9.2 Ad Hoc DFT Techniques 10

  11. Multiplexing Monitor Points • For limited IO pins, we can use multiplexer • Drawback – can monitor only one OP at a time -> increases test time • Select lines can be driven by a counter Tradeoff between test time and IO pins. N clock cycles are required between test vectors 9.2 Ad Hoc DFT Techniques 11

  12. Demux/Latch for Multiple CPs • Values of 2 n control points are serially applied to input Z • Stored in N bit-wide latch 350 DESIGN FOR TESTABILITY • Need N cycles to set up the control values R CPl 1 2 CP2 D E Z M U CPN N X 2 ... 1 n Xl X2 Xn 9.2 Ad Hoc DFT Techniques 12 Figure 9.3 Using a demultiplexer and latch register to implement control points normal normal n functional functional D inputs signals normal n E n M primary primary M R outputs U inputs U X n control X n observation n test test S s points points SELECT SELECT (b) (a) Figure 9.4 Time-sharing I/O ports 3. enable and read/write inputs to memory devices; 4. clock and preset/clear inputs to memory devices such as flip-flops, counters, and shift registers; 5. data select inputs to multiplexers and demultiplexers; 6. control lines on tristate devices. Examples of good candidates for observation points are as follows:

  13. Time-Sharing Normal I/O Pins 9.2 Ad Hoc DFT Techniques 13

  14. Signal Selection – Control Points • Control, address, and data bus lines on bus- structured designs • Enable/hold inputs to microprocessors • Enable and read/write inputs to memory devices • Clock and preset/clear inputs to memory devices • Data select inputs to muxes/demuxes • Control lines on tri-state devices 9.2 Ad Hoc DFT Techniques 14

  15. Signal Selection – Observation Points • Stem lines associated with signals having high fanout • Global feedback paths • Redundant signal lines • Outputs of logic devices having many inputs (muxes, parity generators) • Outputs from state devices (FFs, Counters, Shift Registers) • Address, control, and data busses 9.2 Ad Hoc DFT Techniques 15

  16. 2 – Initialization Design circuits to be easily initializable Should be avoided! 9.2 Ad Hoc DFT Techniques 16

  17. Set/reset controlled by logic gates Set/reset signal controlled internally 9.2 Ad Hoc DFT Techniques 17

  18. 5 – Partitioning Counters and Shift Registers Partition large counters and shift registers into smaller units • Counters/SR are difficult to test because test sequences usually require many clock cycles • Partition the register for better control/obs. 9.2 Ad Hoc DFT Techniques 18

  19. 9.2 Ad Hoc DFT Techniques 19

  20. 6. Partitioning of Large Comb. Circuits Partition large circuits into small subcircuits to reduce test generation costs. Ad Hoc Design for Testability Techniques 357 • Time complexity of test generation grows faster than a B s linear function of circuit size A C • Partitioning can reduce the test generation cost m n \11 \1 \11 \1 D, :::.. p C 1 C 2 ..::: ,E q t t 9.2 Ad Hoc DFT Techniques F G 20 (a) B C A A' D C 2 T 1 T 2 Mode S 1 C' 0 0 normal M 0 1 test C 1 U 1 0 test C 2 E X 0 G F o 1 1 0 MUX S S MUX F' G' (b) Figure 9.11 Partitioning to reduce test generation cost

  21. Ad Hoc Design for Testability Techniques 357 B s Ad Hoc Design for Testability Techniques 357 C A m n \11 \1 \11 \1 B D, s :::.. p C A C 1 C 2 m n ..::: ,E \11 \1 \1 \11 q D, :::.. t t p F G C 1 C 2 (a) ..::: ,E B q t t C A F G (a) A' B D C 2 A C T 1 T 2 Mode S 1 C' 0 0 normal A' M 0 1 test C 1 U 1 0 test C 2 E D X 0 F G C 2 T 1 T 2 Mode o 1 S 1 1 0 C' 0 0 normal MUX S M S MUX 0 1 test C 1 U 1 0 test C 2 E X 0 F' G' G F (b) 9.2 Ad Hoc DFT Techniques 21 o 0 1 1 Figure 9.11 Partitioning to reduce test generation cost MUX S S MUX G' F' (b) Figure 9.11 Partitioning to reduce test generation cost

  22. 7 – Logical Redundancy • Rule: Avoid the use of redundant logic. • Redundancy makes faults undetectable • It may invalidate some test for nonredundant faults • Can cause difficulty in fault coverage calculations • Redundancy can be introduced inadvertantly – Maybe difficult to remove. – Test points can be added to remove redundancy during testing 9.2 Ad Hoc DFT Techniques 22

  23. Scan Registers • Test points are costly in terms of I/O pins • Scan Register is an alternative – tradeoff between test time, area, and I/O pins • Scan Register (SR) = Register with both shift and parallel-load capability • Storage cells in SR can be used as observation and control points 9.3 Scan Registers 23

  24. Controllability and Observability by Means of Scan Registers 359 Scan Storage Cell (SSC) sse D Q, SO D s, sse NIT CK (a) (b) Normal mode: D is loaded N/T = 0 D 1 D n Ql D 2 Q2 Qn Testing mode: S is loaded N/T = 1 9.3 Scan Registers Sin 24 SOU! NIT CK (c) (d) (a) A scan storage cell (SSC) (b) Symbol for a sse (c) A scan Figure 9.12 register (SR) or shift register chain (d) Symbol for a scan register Simultaneous Controllability and Observability Figure 9.13(a) shows two complex circuits C 1 and C 2 • They can be either combinational or sequential. Only one signal (Z) between C 1 and C 2 is shown. Figure 9.13(b) depicts how line Z can be made both observable and controllable using Data at Z can be loaded into the sse and observed by means of a a scan storage cell. Data can be loaded into the sse via a scan-in operation and then scan-out operation. injected onto line Z'. Simultaneous controllability and observability can be achieved. That is, the scan register can be preloaded with data to be injected into the circuit.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend