Decoder Expansion

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/digital-logic/combinational-circuit/demux-decoder-encoder/asset-decoder-expansion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, 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), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the concept of "Decoder Expansion" in digital logic design. The instructor, Sanchit Jain Sir, demonstrates how to construct a larger decoder using smaller decoder modules. Specifically, he illustrates the expansion of a 2x4 decoder to create a 3x8 decoder configuration. The lesson involves drawing circuit diagrams on a digital whiteboard, connecting inputs and enable pins, and verifying the logic through specific input examples. The core concept is using the most significant bit (MSB) of the input to select which sub-decoder is active, thereby expanding the decoding capability.

Chapters

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

    The instructor introduces the topic "Decoder Expansion" and begins drawing a circuit diagram. He writes "2x4" and "1x2" at the top, indicating the components involved. He draws two 2x4 decoder blocks stacked vertically. He connects the input lines I1 and I0 to both decoder blocks. He then focuses on the Enable (E) pins. He connects the Enable pin of the top decoder to the inverted output of a NOT gate driven by input I1. Conversely, he connects the Enable pin of the bottom decoder directly to input I1. This setup ensures that when I1 is 0, the top decoder is active, and when I1 is 1, the bottom decoder is active. He labels the outputs O0, O1 for the top block and O2, O3 for the bottom block, showing how the total outputs are combined.

  2. 2:00 – 2:51 02:00-02:51

    The instructor proceeds to verify the circuit's functionality with a specific input case. He writes '1' next to input I1 and '0' next to input I0. He points out that since I1 is 1, the Enable pin of the bottom decoder is active, while the top decoder is disabled (indicated by crossing it out). He traces the logic to the bottom decoder's inputs, where I1=1 and I0=0 corresponds to binary 10. He identifies that output O2 of the bottom decoder should be active. He circles output O2 to highlight it as the active line. This practical demonstration confirms that the expanded decoder correctly maps the 3-bit input to the corresponding single active output line among the 8 possible outputs.

The lecture effectively bridges theoretical concepts with practical circuit design. By starting with the basic 2x4 decoder structure and systematically adding a second unit controlled by the MSB, the instructor clarifies how decoder expansion works. The use of the enable pin as a selection mechanism is the key takeaway. The verification step with specific binary inputs (10) solidifies the understanding of how the expanded circuit behaves, ensuring students grasp that only the selected sub-decoder processes the remaining input bits to activate the final output correctly.

Loading lesson…