Hazard

Duration: 16 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/digital-logic/combinational-circuit/hazards-timing/asset-hazard after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture provides a comprehensive overview of hazards in digital logic circuits, specifically focusing on static and dynamic hazards. The instructor begins by defining a hazard as an unwanted glitch caused by unequal propagation delays in logic paths. The core of the lesson involves a detailed worked example using a Boolean function f(A, B, C) = Σm(1, 5, 6, 7). The instructor demonstrates how to derive the minimal Sum of Products (SOP) expression using a Karnaugh map, implement it with a 2-level AND-OR circuit, and then analyze the circuit for Static 1 and Static 0 hazards. The lecture concludes by explaining how to eliminate these hazards using redundant terms and defining Dynamic Hazards.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a slide titled 'Hazard' defining the concept as an unwanted short glitch appearing at the output of a digital circuit due to different delays in logic paths. The text explicitly states that even if the logic is correct, the output may momentarily spike or drop, leading to false behavior. The slide lists three types of hazards: 1. Static Hazard, 2. Dynamic Hazard, and 3. Essential Hazard. The instructor emphasizes that these glitches occur in fast or asynchronous systems and sets the stage for understanding why minimal logic implementations can be problematic.

  2. 2:00 – 5:00 02:00-05:00

    A specific problem is introduced on screen: 'Q. The Boolean function f(A, B, C) = Σm(1, 5, 6, 7) is implemented using its minimal SOP expression using a 2-level AND-OR circuit.' The instructor begins solving this by drawing a 3-variable Karnaugh map. He labels the rows with variable A (0 and 1) and the columns with variables BC in Gray code order (00, 01, 11, 10). He then proceeds to fill the map with 1s corresponding to the minterms 1, 5, 6, and 7, preparing the ground for simplification.

  3. 5:00 – 10:00 05:00-10:00

    The instructor groups the 1s in the K-map to find the minimal expression. He identifies a vertical group covering minterms 1 and 5, which simplifies to the term $ar{B}C$. He then identifies a horizontal group covering minterms 6 and 7, which simplifies to the term $AB$. The resulting minimal SOP expression is written as $f(A, B, C) = ar{B}C + AB$. Following this, he draws the corresponding 2-level AND-OR circuit diagram, showing two AND gates feeding into a single OR gate, representing the two product terms.

  4. 10:00 – 15:00 10:00-15:00

    The instructor analyzes the circuit for hazards by considering a transition from input 111 to 101. He notes that for the first AND gate (inputs A, B), the output changes from 1 to 0 with a delay of 2ns. For the second AND gate (inputs $ar{B}$, C), the output changes from 0 to 1 with a delay of 4ns. Due to these unequal delays, there is a brief moment where both AND gate outputs are 0, causing the final OR gate output to glitch from 1 to 0 and back to 1. This is identified as a Static 1 Hazard. To eliminate this, he adds a redundant consensus term $AC$ to cover the transition, resulting in the hazard-free expression $ar{B}C + AB + AC$. He draws the updated circuit with three AND gates to implement this new expression.

  5. 15:00 – 15:35 15:00-15:35

    The final segment introduces the concept of a Dynamic Hazard. A slide defines it as a glitch where the output is supposed to change from one value to another (e.g., 0 to 1) but changes multiple times before settling due to unequal delays. The example provided shows the expected output as 0 -> 1, while the actual behavior is described as 0 -> 1 -> 0 -> 1, indicating temporary fluctuations. This concludes the lecture by distinguishing dynamic hazards from the static hazards previously analyzed.

The lecture systematically builds understanding of digital circuit hazards. It starts with a theoretical definition, moves to a practical application using a K-map and Boolean algebra, and then delves into the physical reality of gate delays causing glitches. The key takeaway is that minimal logic implementations are susceptible to Static 1 and Static 0 hazards, which can be eliminated by adding redundant consensus terms to ensure all adjacent 1s (or 0s) are covered by a single product term. The lesson concludes by briefly defining Dynamic Hazards as more complex multi-transition glitches.

Loading lesson…