Design for Testability
|
|
- Stella Mitchell
- 5 years ago
- Views:
Transcription
1 Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning of registers and large combinational circuits Scan-Path Design Scan-path design concept Controllability and observability by means of scan-path Full and partial serial scan-paths Non-serial scan design Classical scan designs
2 Ad Hoc Design for Testability Techniques Method of Test Points: Block Block 2 Improving controllability and observability: Block Block 2 OP CP OP Block Block 2 CP Block is not observable, Block 2 is not controllable - controllability: CP = - normal working mode CP = - controlling Block 2 with signal - controllability: CP = - normal working mode CP = - controlling Block 2 with signal
3 Ad Hoc Design for Testability Techniques Method of Test Points: Block Block 2 Block is not observable, Block 2 is not controllable Improving controllability: Block CP CP2 Block Block 2 CP CP2 MUX Block 2 Normal working mode: CP =, CP2 = Controlling Block 2 with : CP =, CP2 = Controlling Block 2 with : CP2 = Normal working mode: CP2 = Controlling Block 2 with : CP =, CP2 = Controlling Block 2 with : CP =, CP2 =
4 Ad Hoc Design for Testability Techniques Multiplexing monitor points: To reduce the number of output pins for observing monitor points, multiplexer can be used: 2 n observation points are replaced by a single output and n inputs to address a selected observation point Disadvantage: Only one observation point can be observed at a time x x 2 x n MUX 2 n - MUX OUT Number of additional pins: (n + ) Number of observable points: [2 n ] Advantage: (n + ) << 2 n
5 Ad Hoc Design for Testability Techniques Multiplexing monitor points: To reduce the number of output pins for observing monitor points, multiplexer can be used: To reduce the number of inputs, a counter (or a shift register) can be used to drive the address lines of the multiplexer Disadvantage: Only one observation point can be observed at a time c 2 n - MUX Counter Number of additional pins: 2 Nmber of observable points: [2 n ] Advantage: 2 < n << 2 n OUT
6 Ad Hoc Design for Testability Techniques Demultiplexer for implementing control points: x DMUX CP CP2 To reduce the number of input pins for controlling testpoints, demultiplexer and a latch register can be used. 2 n - CPN Disadvantage: x x 2 x n N clock times are required between test vectors to set up the proper control values Number of additional pins: (n + ) Number of control points: 2 n- N 2 n Advantage: (n + ) << N
7 Ad Hoc Design for Testability Techniques Demultiplexer for implementing control points: x DMUX CP CP2 To reduce the number of input pins for controlling testpoints, demultiplexer and a latch register can be used. c 2 n - Counter CPN To reduce the number of inputs for addressing, a counter (or a shift register) can be used to drive the address lines of the demultiplexer Disadvantage: Number of additional pins: 2 Number of control points: N Advantage: 2 << N N clock times are required between test vectors to set up the proper control values
8 Time-sharing of outputs for monitoring To reduce the number of output pins for observing monitor points, timesharing of working outputs can be introduced: no additional outputs are needed MUX To reduce the number of inputs, again counter or shift register can be used if needed Original circuit Number of additional pins: Number of control points: N Advantage: << N
9 Time-sharing of inputs for controlling Normal input lines DMUX N CP CP2 CPN To reduce the number of input pins for controlling test points, time-sharing of working inputs can be introduced. To reduce the number of inputs for driving the address lines of demultiplexer, counter or shift register can be used if needed Number of additional pins: Number of control points: N Advantage: << N
10 Example: DFT with MUX-s and DMUX-s Given a circuit: - CP and CP2 are not controllable - CP3 and CP4 are not observable DFT task: Improve the testability by using a single control input, no additional inputs/outputs allowed CP CP2 CP3 CP
11 Example: DFT with MUX-s and DMUX-s Given a circuit: CP3 and CP4 are not observable Improving the observability Coding: T Mode Norm. Test MUX T CP CP2 CP3 CP MUX MUX Result: A single pin T is needed
12 Example: DFT with MUX-s and DMUX-s Given a circuit: CP and CP2 are not controllable Improving the controllability T Counter Decoder Result: A single pin T is needed Q DMUX DMUX FF FF Coding: CP MUX MUX Q CP2 CP3 CP4 Mode Norm. Contr Test DMUX MUX x
13 Example: DFT with MUX-s and DMUX-s T Counter Decoder x z z x 2 2 F F z 3 3 x y 3 Q F 2 z 4 F 4 Q Mode DMUX MUX MUX 2 Norm Contr x x Test Obs Obs 2 Obs 3 DMUX DMUX FF FF CP MUX Result: A single pin T is needed CP 2 CP 3 MUX MUX CP4
14 Ad Hoc Design for Testability Techniques Examples of good candidates for control points: control, address, and data bus lines on bus-structured designs enable/hold inputs of microprocessors enable and read/write inputs to memory devices clock and preset/clear inputs to memory devices (flip-flops, counters,...) data select inputs to multiplexers and demultiplexers control lines on tristate devices Examples of good candidates for observation points: stem lines associated with signals having high fanout global feedback paths redundant signal lines outputs of logic devices having many inputs (multiplexers, parity generators) outputs from state devices (flip-flops, counters, shift registers) address, control and data busses
15 Fault redundancy and testability x x 2 x 4 x 3 y ) ( x y x x x x x x y Faults at x 2 not testable x x 2 x 4 x 3 y x x x x x x x y Redundant gates are removed: Fault at x 2 not testable x 2 x Remaining gate
16 Ad Hoc Design for Testability Techniques Logical redundancy: Redundancy should be avoided: If a redundant fault occurs, it may invalidate some test for nonredundant faults Redundant faults cause difficulty in calculating fault coverage Much test generation time can be spent in trying to generate a test for a redundant fault Redundancy intentionally added: To eliminate hazards in combinational circuits To achieve high reliability (using error detecting circuits) T Hazard control circuitry: Redundant AND-gate Fault not testable Additional control input added: T = - normal working mode T = - testing mode
17 Ad Hoc Design for Testability Techniques Fault redundancy: Error control circuitry: Decoder Testable error control circuitry: Decoder No error T Error detected E = if decoder is fault-free Fault not testable Additional control input added: T - normal working mode T = - testing mode
18 Ad Hoc Design for Testability Techniques Partitioning of registers (counters): IN OUT IN OUT C REG REG 2 CL CL 6 bit counter divided into two 8-bit counters: Instead of 2 6 = clocks, 2x2 8 = 52 clocks needed If tested in parallel, only 256 clocks needed CP: Data Inhibit C CP: Tester Data IN CL CP: Tester Data CP: Data Inhibit OUT REG REG 2 IN CL OUT CP: Clock Inhibit OP CP: Tester Clock
19 Ad Hoc Design for Testability Techniques Partitioning of large combinational circuits: C C2 DMUX MUX DMUX2 C C2 How many additional inputs are needed? MUX3 MUX2 MUX4 The time complexity of test generation and fault simulation grows faster than a linear function of circuit size Partioning of large circuits reduces these costs I/O sharing of normal and testing modes is used Three modes can be chosen: - normal mode - testing C - testing C2 (bolded lines)
20 Scan-Path Design IN Scan-IN Combinational circuit OUT The complexity of testing is a function of the number of feedback loops and their length The longer a feedback loop, the more clock cycles are needed to initialize and sensitize patterns q R q Scan-register is a aregister with both shift and parallel-load capability T = - normal working mode Scan-OUT T = - scan mode q Scan-IN T D C T q Scan-OUT Normal mode : flip-flops are connected to the combinational circuit Test mode: flip-flops are disconnected from the combinational circuit and connected to each other to form a shift register
21 Scan-Path Design and Testability Two possibilities for improving controllability/observability SCAN OUT MUX OUT IN DMUX SCAN IN
22 Parallel Scan-Path IN Combinational circuit OUT Scan-IN Scan-OUT Scan-IN 2 R R2 In parallel scan path flipflops can be organized in more than one scan chain Advantage: time Disadvantage: # pins Scan-OUT 2
23 Partial Scan-Path IN Scan-IN Combinational circuit R OUT In partial scan instead of full-scan, it may be advantageous to scan only some of the flip-flops Scan-OUT R2 Example: counter even bits joined in the scanregister
24 Partial Scan Path Scan-In Hierarhical test generation with Scan-Path: Control Part R 2 y 4 # R IN y y 2 y 3 y 4 M M 2 a b + * c d e M 3 R 2 Data Part Scan-Out Bus R 2 2 y 3 y R + R 2 IN 2 3 R y 2 IN + R 2 R * R 2 IN* R 2
25 Testing with Minimal DFT Hierarhical test generation with Scan-Path: Control Part R 2 y 4 # R IN y y 2 y 3 y 4 M M 2 a b + * c d Scan-In e M 3 R 2 Data Part Scan-Out Bus R 2 2 y 3 y R + R 2 IN 2 3 R y 2 IN + R 2 R * R 2 IN* R 2
26 Random Access Scan IN Scan-IN Scan-CL Combinational circuit q R q Scan-OUT OUT In random access scan each flip-flop in a logic network is selected individually by an address for control and observation of its state X-Address DC Example: Delay fault testing Y-Address DC
27 Design for Testability Control Points Two possibilities for improving controllability/observability SCAN OUT MUX OUT IN DMUX SCAN IN Two problems with CP-s: access and minimization
28 DFT for Random BIST Functional BIST Random BIST Test generator Traditional functional testing SW Based Self-Test for microprocessors Functional BIST HW overhead UUT Signature Normal operation UUT Result UUT Result Signature Reference Go/NoGo Reference Go/NoGo HW overhead Reference Go/NoGo Random test Universal solutions based on DFT measures Deterministic functional test set Dedicated solutions based on Fault Simulation
29 Selection of Test Points Test point selection approaches Improving testability for any set of pseudo-random patterns (Pseudorandom BIST) Testability measures are used to characterize the controllability and observability of the circuit (independently of the test applied) Improving testability for a given sequence of vectors (Functional BIST) Fault simulation is used for measuring the fault coverage Methods that are used: logic simulation, fault simulation, evaluation (measuring) of controllability and observability
30 Adhoc Iterative DFT Improvement Circuit Test sequence Fault Simulation Not detected faults Fault coverage % Circuit modification Selection of CPs
31 High-Level Functional BIST Example: Functional BIST for Pipe-Lined Circuits Two solutions MISR monitors on every register MISR monitors on part of the register (Combine blocks with good coverage)
32 Selection of Test Points Method: Simulation of given test patterns Identification of the faults that are detected The remaining faults are classified as A: Faults that were not excited B: Faults at gate inputs that were excited but not propagated to the gate output C: Faults that were excited but not propagated to circuit output The faults A and B require control points for their detection The faults C may be detected by either by observation points or by control points Control points selection should be carried out before observation points selection
33 Classification of Not-Detected Faults Classes A and B need controllability x x 2 x 3 x 4 x 5 Always Class A: Fault x 3 is not activated Class C: Faults at x are not propagated to the output Class B: y Faults at x 5 are not propagated through the gate Class C needs either controllability or observability
34 Selection of Test Points Classification of faults Given test: No Test patterns Inputs Intern. points Fault table Inputs Intern. points a b c a b c x / x 2 / x 3 / a / b / x a x 2 x 3 x 4 x 5 Not detected faults: Class Faults b c Missing signals A x /: x = is missing A b /: b = is missing B x 3 /: x 3 a = is missing B a /: x 3 a = is missing C x 2 /: x x 2 = OK y
35 Selection of Test Points Classification of faults Given test: No Test patterns Inputs Intern. points Fault table Inputs Intern. points a b c a b c x / x 2 / x 3 / a / b / x a x 2 x 3 x 4 x 5 Not detected faults: Class Faults b c Missing signals A x /: x = is missing A b /: b = is missing B x 3 /: x 3 a = is missing B a /: x 3 a = is missing C x 2 /: x x 2 = OK y
36 Selection of Test Points Classification of faults Given test: No Test patterns Inputs Intern. points Fault table Inputs Intern. points a b c a b c x / x 2 / x 3 / a / b / x a x 2 x 3 x 4 x 5 Not detected faults: Class Faults b c Missing signals A x /: x = is missing A b /: b = is missing B x 3 /: x 3 a = is missing B a /: x 3 a = is missing C x 2 /: x x 2 = OK y
37 Selection of Test Points Classification of faults Given test: No Test patterns Inputs Intern. points Fault table Inputs Intern. points a b c a b c x / x 2 / x 3 / a / b / x a x 2 x 3 x 4 x 5 Not detected faults: Class Faults b c Missing signals A x /: x = is missing A b /: b = is missing B x 3 /: x 3 a = is missing B a /: x 3 a = is missing C x 2 /: x x 2 = OK y
38 Selection of Test Points Classification of faults Given test: No Test patterns Inputs Intern. points Fault table Inputs Intern. points a b c a b c x / x 2 / x 3 / a / b / x a x 2 x 3 x 4 x 5 Not detected faults: Class Faults Missing signals A x /: x = is missing A b /: b = is missing B x 3 /: x 3 a = is missing b c B a /: x 3 a = is missing C x 2 /: x x 2 = OK, but path activation x 3 is missing y
39 Selection of Test Points: Procedure. Selection of control points: CP CP2 F F2 CP3 F3 CP F F2 F3 Control point candidates F F2 F3 F4 F5 F6 F7 F8 F9 CP CP2 CP3 CP4 CP5 Faults, not detected Selected control points
40 Selection of Test Points: Procedure. Selection of control points: Once control point candidates are identified for the faults A and B, a minimum number of control points (CP) can be identified This can be formulated as a minimum coverage problem where a minimum CPs are selected such that at least one CP candidate is included for each fault in A and B Control point candidates F F2 F3 F4 F5 F6 F7 F8 F9 CP CP2 CP3 CP4 CP5 Faults, not detected Selected control points
41 Selection of Test Points: Procedure. Selection of observation points: F F2 CP2 F3 CP3 F F2 F3 CP3 CP Control point candidates F F2 F3 F4 F5 F6 F7 F8 F9 CP CP2 CP3 CP4 CP5 Faults, not detected Selected control points
42 Selection of Test Points: Procedure 2. Selection of observation points Control Test Once the CPs are selected, the given test patterns are augmented to accommodate the additional inputs assotiated with the CPs and fault simulation is performed The fault class C is updated For each fault, in C the circuit lines to which the effect of the fault propagates, are identified as a potential observation point candidates A minimum covering problem is formulated and solved to find the observation points to be added New fault simulation DMUX CP CP2 CPN Fault class C updated Minimization of control points F F2 F3 F4 F5 F6 F7 F8 F9 CP CP2 CP3 CP4 CP5
43 Insertion of Test Points Test point for x / All faults detected: Class A: x /, b / Class B: x 3 /, a /, x x 2 x 3 x / x 3 / x4 x 5 a a / b b / c y T = This pattern is to be repeated with T = No Test patterns Inputs Intern. points a b c 2 3 Corrected circuit: x T = a a / x 2 x 3 x / x 3 / x4 x 5 c b b / y
44 Selection of Test Points Minimization of test points: Not detected faults: Class A: x /, b / Class B: x 3 /, a /, Test point coverage: To be selected Potential control points Not detected faults x / x 3 / a / b / x = x 3 = a = b = + x Corrected circuit: x 2 x 3 No x / a T = a / x 3 / x4 x 5 Test patterns Inputs b b / c Intern. points a b c 2 3 y
45 Insertion of Test Points Two test points: Selected test points: Class A: x / x = (control point) Class C: x 2 / (observable point) T = This pattern is to be repeated with T = No Test patterns Inputs Intern. points a b c 2 3 x x 2 x 3 x / x 2 / x 3 To be observed x 3 / x4 x 5 a a / Corrected circuit: x T = T 2 x 2 x / x 2 / a x4 x 5 c b b / c b y T 2 y
46 Selection of Test Points Minimization of monitoring points: To reduce the number of output pins for observing monitor points, exor gates can be used: Space and time compaction Additional outputs With EXOR Not accurate Space Without MUX With MUX Time MUX 2 n - OUT OUT c Counter
47 Selection of Test Points Minimization of monitoring points: To reduce the number of output pins for observing monitor points, signature analyzers can be used: Space and time compaction Space With SA - Accurate Additional outputs With EXOR Not accurate With MUX Time MUX 2 n - OUT SA SCAN OUT c Counter SCAN IN
48 Boundary Scan Standard
49 Boundary Scan Architecture internal logic T TDO A P TDI TMS TCK TDO internal logic T A P internal logic T A P T A P TDI TMS TCK TDI Data_in BSC TDO internal logic T A P internal logic TDO Data_out TDI Test Data IN TMS Test Mode Select TCK Test Clock TDO Test Data OUT TAP Test Acess Port
50 Boundary Boundary Scan Architecture Scan Internal logic Registers Data Registers TDI Device ID. Register Bypass Register TDO Instruction Register (IR)
51 Boundary Scan Cell To next cell From system pin To system logic From last cell Shift DR D SET CLR Q Q Clock DR For SHIFT D SET CLR Q Q Update DR For HOLD Test/Normal Used at the input or output pins
52 Boundary Scan Working Modes SAMPLE mode: Get snapshot of normal chip output signals (monitoring mode)
53 Boundary Scan Working Modes PRELOAD mode: Put data on boundary scan chain before next instruction
54 Boundary Scan Working Modes Extest instruction: Test off-chip circuits and board-level interconnections
55 Boundary Scan Working Modes INTEST instruction Feeds external test patterns in and shifts responses out
56 Boundary Scan Working Modes Bypass instruction: Bypasses the corresponding chip using -bit register From TDI Shift DR Clock DR D SET CLR Q Q To TDO
57 Boundary Scan Working Modes IDCODE instruction: Connects the component device identification register serially between TDI and TDO in the Shift-DR TAP controller state Allows board-level test controller or external tester to read out component ID Required whenever a JEDEC identification register is included in the design TDI Version Part Number Manufacturer ID TDO 4-bits Any format 6-bits Any format -bits Coded form of JEDEC
58 Fault Detection with Boundary Scan Short Assume wired AND Open Assume stuck-at-
59 Any Bridge Detection with Boundary Scan Short Assume wired AND Open Assume stuck-at- Kautz showed in 974 that a sufficient condition to detect any pair of short circuited nets was that the horizontal codes must be unique for all nets. Therefore the test length is ]log 2 (N)[
60 Any Fault Detection with Boundary Scan Short Suspected Wired AND short Assume wired AND Ambiguiety Open Suspected open fault SAF/ Assume stuck-at- All -s and all -s are forbidden codes because of stuck-at faults Therefore the final test length is ]log 2 (N+2)[
61 Fault Diagnosis with Boundary Scan Short Suspected Wired AND short Assume wired AND Ambiguiety solved Open Suspected open fault SAF/ Assume stuck-at- To improve the diagnostic resolution we have to add one bit more
62 Synthesis of Testable Circuits y x x x 3 x2 Test generation: x x 3 x 2 y y x x x 3 x2 x x 2 x 3 y 4 test patterns are needed
63 Synthesis of Testable Circuits Two implementations for the same circuit: x x 3 y x x x 3 x2 y x x 2 x 3 y x 2 First assignment Here: 4 test patterns are needed Here: Only 3 test patterns are needed
64 Synthesis of Testable Circuits Test generation method: y x x x x x x Roles of test patterns: x x 2 x 3 x x 2 x 3 y
Design for Testability
Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning
More informationIHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke
IHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke Integrierte Hard- und Softwaresysteme RT-Level Design data path and control path on RT-level RT level simulation Functional units (F1,..,F4)
More informationIntroduction to VLSI Testing
Introduction to 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Problems to Think How are you going to test A 32 bit adder A 32 bit counter A 32Mb
More informationUMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.
Overview Design for testability(dft) makes it possible to: Assure the detection of all faults in a circuit. Reduce the cost and time associated with test development. Reduce the execution time of performing
More informationHardware testing and design for testability. EE 3610 Digital Systems
EE 3610: Digital Systems 1 Hardware testing and design for testability Introduction A Digital System requires testing before and after it is manufactured 2 Level 1: behavioral modeling and test benches
More informationLogic BIST. Sungho Kang Yonsei University
Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2013-2014 Final Examination CLOSED BOOK Kewal K. Saluja Date:
More informationVLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
VLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 54 Design for Testability So, in the last lecture we talked
More informationECE 3060 VLSI and Advanced Digital Design. Testing
ECE 3060 VLSI and Advanced Digital Design Testing Outline Definitions Faults and Errors Fault models and definitions Fault Detection Undetectable Faults can be used in synthesis Fault Simulation Observability
More informationS No. Questions Bloom s Taxonomy Level UNIT-I
GROUP-A (SHORT ANSWER QUESTIONS) S No. Questions Bloom s UNIT-I 1 Define oxidation & Classify different types of oxidation Remember 1 2 Explain about Ion implantation Understand 1 3 Describe lithography
More informationSingle Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference
Single Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference Copyright 1998 Elizabeth M. Rudnick 1 Modeling the effects
More informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationOverview. 4. Built in Self-Test. 1. Introduction 2. Testability measuring 3. Design for testability. Technical University Tallinn, ESTONIA
Overview. Introduction 2. Testability measuring 3. Design for testability 4. Built in Self-Test Built-In Self-Test Outline Motivation for BIST Testing SoC with BIST Test per Scan and Test per Clock HW
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationBuilt-In Self-Test. Outline
Built-In Self-Test Outline Motivation for BIST Testing SoC with BIST Test per Scan and Test per Clock HW and SW based BIST Exhaustive and pseudoexhaustive test generation Pseudorandom test generation with
More informationBuilt-In Test Generation for Synchronous Sequential Circuits
Built-In Test Generation for Synchronous Sequential Circuits Irith Pomeranz and Sudhakar M. Reddy + Electrical and Computer Engineering Department University of Iowa Iowa City, IA 52242 Abstract We consider
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationFault Modeling. Fault Modeling Outline
Fault Modeling Outline Single Stuck-t Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of oolean Difference Copyright 1998 Elizabeth M. Rudnick
More informationECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3
ECE 512 Digital System Testing and Design for Testability Model Solutions for Assignment #3 14.1) In a fault-free instance of the circuit in Fig. 14.15, holding the input low for two clock cycles should
More informationMODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques
MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques Subject Code: Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 DEPARTMENT: EEE QUESTION BANK SUBJECT NAME: DIGITAL LOGIC CIRCUITS SUBJECT CODE: EE55 SEMESTER IV UNIT : Design of Synchronous Sequential Circuits PART
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
DEPARTMENT: ECE MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 QUESTION BANK SUBJECT NAME: DIGITAL ELECTRONICS UNIT : Design of Sequential Circuits PART A ( Marks). Draw the logic diagram 4: Multiplexer.(AUC
More informationChapter 2 Fault Modeling
Chapter 2 Fault Modeling Jin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering National Central University Jungli, Taiwan Outline Why Model Faults? Fault Models (Faults)
More informationUNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables
UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1
More informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationOutline - BIST. Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture. K.T. Tim Cheng 08_bist, v1.
1 Outline - BIST Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture 2 Why Built-In Self Test? TYPES On-Line Self-Test (Concurrent Checking) Functional Self-Test
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationEECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
More informationPreparation of Examination Questions and Exercises: Solutions
Questions Preparation of Examination Questions and Exercises: Solutions. -bit Subtraction: DIF = B - BI B BI BO DIF 2 DIF: B BI 4 6 BI 5 BO: BI BI 4 5 7 3 2 6 7 3 B B B B B DIF = B BI ; B = ( B) BI ( B),
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationMenu. Excitation Tables (Bonus Slide) EEL3701 EEL3701. Registers, RALU, Asynch, Synch
Menu Registers >Storage Registers >Shift Registers More LSI Components >Arithmetic-Logic Units (ALUs) > Carry-Look-Ahead Circuitry (skip this) Asynchronous versus Synchronous Look into my... 1 Excitation
More informationVLSI Design I. Defect Mechanisms and Fault Models
VLSI Design I Defect Mechanisms and Fault Models He s dead Jim... Overview Defects Fault models Goal: You know the difference between design and fabrication defects. You know sources of defects and you
More informationALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
More informationAdvanced Testing. EE5375 ADD II Prof. MacDonald
Advanced Testing EE5375 ADD II Prof. MacDonald Functional Testing l Original testing method l Run chip from reset l Tester emulates the outside world l Chip runs functionally with internally generated
More informationAnalysis of Clocked Sequential Circuits
Objectives Analysis of Clocked Sequential Circuits The objectives of this lesson are as follows: Analysis of clocked sequential circuits with an example State Reduction with an example State assignment
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits Flip-Flops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES
More informationT st Cost Reduction LG Electronics Lee Y, ong LG Electronics 2009
Test Cost Reduction LG Electronics Lee, Yong LG Electronics 2009 Contents Introduction Key factors for test cost reduction in DFT Test vector volume Low cost ATE Test time Reuse a large block Test cost
More informationBoolean Logic Continued Prof. James L. Frankel Harvard University
Boolean Logic Continued Prof. James L. Frankel Harvard University Version of 10:18 PM 5-Sep-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. D Latch D R S Clk D Clk R S X 0 ~S 0 = R 0 ~R
More informationSequential Logic Worksheet
Sequential Logic Worksheet Concept Inventory: Notes: D-latch & the Dynamic Discipline D-register Timing constraints for sequential circuits Set-up and hold times for sequential circuits 6.004 Worksheet
More informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
More informationDistributed by: www.jameco.com 1-800-831-4242 The content and copyrights of the attached material are the property of its owner. INTEGRATED CIRCUITS DATA SHEET For a complete data sheet, please also download:
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationA Hardware Approach to Self-Testing of Large Programmable Logic Arrays
EEE TRANSACTONS ON COMPUTERS, VOL. C-30, NO. 11, NOVEMBER 1981 A Hardware Approach to Self-Testing of Large Programmable Logic Arrays 829 WLFRED DAEHN AND JOACHM MUCHA, MEMBER, EEE Abstract-A hardware
More informationModels for representing sequential circuits
Sequential Circuits Models for representing sequential circuits Finite-state machines (Moore and Mealy) Representation of memory (states) Changes in state (transitions) Design procedure State diagrams
More informationSequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (-9) inputs system outputs Sequential Logic: Output depends not only on current
More informationChapter 3 Digital Logic Structures
Chapter 3 Digital Logic Structures Original slides from Gregory Byrd, North Carolina State University Modified by C. Wilcox, M. Strout, Y. Malaiya Colorado State University Computing Layers Problems Algorithms
More informationVidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B
. (a). (b). (c) S.E. Sem. III [EXTC] igital Electronics Prelim Question Paper Solution ABC ABC ABC ABC ABC ABC ABC ABC = B LHS = ABC ABC ABC ABC ABC ABC ABC ABC But ( ) = = ABC( ) ABC( ) ABC( ) ABC( )
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationDigital Logic Design - Chapter 4
Digital Logic Design - Chapter 4 1. Analyze the latch circuit shown below by obtaining timing diagram for the circuit; include propagation delays. Y This circuit has two external input and one feedback
More informationTopics. CMOS Design Multi-input delay analysis. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut
Topics CMO Design Multi-input delay analysis pring 25 Transmission Gate OUT Z OUT Z pring 25 Transmission Gate OUT When is low, the output is at high impedance When is high, the output follows However,
More informationPGT104 Digital Electronics. PGT104 Digital Electronics
1 Part 6 Sequential Logic ircuits Disclaimer: Most of the contents (if not all) are extracted from resources available for Digital Fundamentals 10 th Edition 2 Basic Shift Register Operations A shift register
More informationVidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution
S.E. Sem. III [ETRX] Digital Circuits and Design Prelim uestion Paper Solution. (a) Static Hazard Static hazards have two cases: static and static. static- hazard exists when the output variable should
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationProgrammable Logic Devices
Programmable Logic Devices Mohammed Anvar P.K AP/ECE Al-Ameen Engineering College PLDs Programmable Logic Devices (PLD) General purpose chip for implementing circuits Can be customized using programmable
More informationEECS 579: SOC Testing
EECS 579: SOC Testing Core-Based Systems-On-A-Chip (SOCs) Cores or IP circuits are predesigned and verified functional units of three main types Soft core: synthesizable RTL Firm core: gate-level netlist
More informationCPS 104 Computer Organization and Programming Lecture 11: Gates, Buses, Latches. Robert Wagner
CPS 4 Computer Organization and Programming Lecture : Gates, Buses, Latches. Robert Wagner CPS4 GBL. RW Fall 2 Overview of Today s Lecture: The MIPS ALU Shifter The Tristate driver Bus Interconnections
More informationESE 570: Digital Integrated Circuits and VLSI Fundamentals
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 23: April 17, 2018 I/O Circuits, Inductive Noise, CLK Generation Lecture Outline! Packaging! Variation and Testing! I/O Circuits! Inductive
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
More informationEECS 579: Logic and Fault Simulation. Simulation
EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationDigital Electronics II Mike Brookes Please pick up: Notes from the front desk
NOTATION.PPT(10/8/2010) 1.1 Digital Electronics II Mike Brookes Please pick up: Notes from the front desk 1. What does Digital mean? 2. Where is it used? 3. Why is it used? 4. What are the important features
More informationS.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationFault Modeling. 李昆忠 Kuen-Jong Lee. Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan. VLSI Testing Class
Fault Modeling 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Fault Modeling Some Definitions Why Modeling Faults Various Fault Models Fault Detection
More informationVLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) True-value Simulator
Design Verification Simulation used for ) design verification: verify the correctness of the design and 2) test verification. Design verification: Response analysis Specification Design(netlist) Critical
More informationSequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science
Sequential Logic Rab Nawaz Khan Jadoon DCS COMSATS Institute of Information Technology Lecturer COMSATS Lahore Pakistan Digital Logic and Computer Design Sequential Logic Combinational circuits with memory
More informationFAULT MODELING. Chapter Defects, Errors, and Faults
Chapter 4 FAULT MODELING... The extreme difficulty of obtaining solutions by conventional mathematical analysis has led in the past to the use of highly unrealistic models simply because they led to equations
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationChapter #6: Sequential Logic Design
Chapter #6: equential Logic esign Contemporary Logic esign No. 6- Cross-Coupled NO Gates ust like cascaded inverters, with capability to force output to (reset) or (set) \ eset Hold et eset et ace \ Forbidden
More informationTest Pattern Generator for Built-in Self-Test using Spectral Methods
Test Pattern Generator for Built-in Self-Test using Spectral Methods Alok S. Doshi and Anand S. Mudlapur Auburn University 2 Dept. of Electrical and Computer Engineering, Auburn, AL, USA doshias,anand@auburn.edu
More informationCMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 17: Dynamic Sequential Circuits And Timing Issues [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan,
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationDigital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationUnit 7 Sequential Circuits (Flip Flop, Registers)
College of Computer and Information Sciences Department of Computer Science CSC 220: Computer Organization Unit 7 Sequential Circuits (Flip Flop, Registers) 2 SR Flip-Flop The SR flip-flop, also known
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationFaculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY
1 McGill University Faculty of Engineering DIGITAL SYSTEM DESIGN ECSE-323 FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY STUDENT NAME McGILL I.D. NUMBER Examiner: Prof. J. Clark Signature: Associate
More informationCHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals CHAPTER 8 Counters Slide 2 Counting
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationper chip (approx) 1 SSI (Small Scale Integration) Up to 99
Q.2 a. Classify the integration technology as per the scale of integration. Explain in brief the various steps involved in fabrication of monolithic IC. Scales of Integration (Basic) Various steps involved
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationMM74C912 6-Digit BCD Display Controller/Driver
6-Digit BCD Display Controller/Driver General Description The display controllers are interface elements, with memory, that drive a 6-digit, 8-segment LED display. The display controllers receive data
More informationAnalysis of clocked sequential networks
Analysis of clocked sequential networks keywords: Mealy, Moore Consider : a sequential parity checker an 8th bit is added to each group of 7 bits such that the total # of 1 bits is odd for odd parity if
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationEECS150 - Digital Design Lecture 21 - Design Blocks
EECS150 - Digital Design Lecture 21 - Design Blocks April 3, 2012 John Wawrzynek Spring 2012 EECS150 - Lec21-db3 Page 1 Fixed Shifters / Rotators fixed shifters hardwire the shift amount into the circuit.
More informationCh 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
More informationDM74LS670 3-STATE 4-by-4 Register File
DM74LS670 3-STATE 4-by-4 Register File General Description August 1986 Revised March 2000 These register files are organized as 4 words of 4 bits each, and separate on-chip decoding is provided for addressing
More informationMicroprocessor Power Analysis by Labeled Simulation
Microprocessor Power Analysis by Labeled Simulation Cheng-Ta Hsieh, Kevin Chen and Massoud Pedram University of Southern California Dept. of EE-Systems Los Angeles CA 989 Outline! Introduction! Problem
More informationDigital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab in-charge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
More informationMemory, Latches, & Registers
Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) How to save a few bucks at toll booths 5) Edge-triggered Registers L13 Memory 1 General Table Lookup Synthesis
More informationESE 570: Digital Integrated Circuits and VLSI Fundamentals
ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 18: March 27, 2018 Dynamic Logic, Charge Injection Lecture Outline! Sequential MOS Logic " D-Latch " Timing Constraints! Dynamic Logic " Domino
More informationSequential Circuits Sequential circuits combinational circuits state gate delay
Sequential Circuits Sequential circuits are those with memory, also called feedback. In this, they differ from combinational circuits, which have no memory. The stable output of a combinational circuit
More informationLecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines 1 Clocks A microprocessor is composed of many different circuits that are operating simultaneously if each
More informationClock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements.
1 2 Introduction Clock signal in digital circuit is responsible for synchronizing the transfer to the data between processing elements. Defines the precise instants when the circuit is allowed to change
More informationDesign at the Register Transfer Level
Week-7 Design at the Register Transfer Level Algorithmic State Machines Algorithmic State Machine (ASM) q Our design methodologies do not scale well to real-world problems. q 232 - Logic Design / Algorithmic
More informationUNIVERSITY OF MASSACHUSETTS LOWELL DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING SYLLABUS FOR THE DOCTORAL QUALIFYING EXAM
UNIVERSITY OF MASSACHUSETTS LOWELL DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING SYLLABUS FOR THE DOCTORAL QUALIFYING EXAM Ph.D/D.Eng. Electrical Engineering Option These are the general topics for the
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More information