Priority Encoder

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/digital-electronics/combinational-circuit/demux-decoder-encoder/asset-priority-encoder after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  7. 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces the Priority Encoder, a digital circuit designed to handle situations where multiple inputs are active simultaneously, a condition that renders standard encoders ineffective. The instructor explains that a priority encoder incorporates a priority function, ensuring that if two or more inputs are high, the input with the highest priority takes precedence. He illustrates this concept by drawing a block diagram with n inputs and binary outputs, emphasizing the need for a circuit that can resolve conflicts between active signals. The text on the screen explicitly states, "In some practical cases more than one input can be high at a time, there we can not use simple encoder." He further clarifies that the operation is such that "the input having the highest priority will take precedence." In the second segment, the instructor details the operation of a 4-to-2 priority encoder using a comprehensive truth table. He establishes the priority order as I3 > I2 > I1 > I0. He systematically fills the truth table, assigning 'd' (don't care) to lower-priority inputs when a higher-priority input is active. For instance, if I3 is 1, the outputs correspond to binary 3, regardless of other inputs. He then derives the Boolean expressions for the outputs O1 and O0 based on the populated truth table, writing O0 = I3 + I3'I2'I1 and O1 = I3 + I3'I2 on the board. This process demonstrates how to simplify logic for priority-based encoding. The instructor points to specific rows in the table to justify the 'd' values, showing that lower inputs are irrelevant when a higher one is asserted. He specifically writes the equation for O0 first, noting that it is high when I3 is high or when I3 and I2 are low but I1 is high. Similarly, O1 is high when I3 is high or when I3 is low and I2 is high. This detailed derivation provides a clear method for designing priority encoder logic circuits. The table shows rows for inputs 0001, 001d, 01dd, and 1ddd, mapping to outputs 00, 01, 10, and 11 respectively.

Chapters

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

    The instructor introduces the concept of a Priority Encoder, explaining that simple encoders fail when multiple inputs are high simultaneously. He draws a block diagram with n inputs and binary outputs to visualize the circuit. The on-screen text highlights that in practical cases, more than one input can be high, necessitating a circuit with a priority function where the highest priority input takes precedence.

  2. 2:00 – 4:16 02:00-04:16

    The instructor constructs a truth table for a 4-to-2 priority encoder with inputs I3, I2, I1, I0 and outputs O1, O0. He fills the table based on the priority order I3 > I2 > I1 > I0, using 'd' for don't care conditions. He derives the Boolean expressions O0 = I3 + I3'I2'I1 and O1 = I3 + I3'I2, pointing to specific rows to justify the logic and don't care assignments.

The video progresses from defining the problem of multiple active inputs to the solution of a priority encoder, and finally to the implementation via a truth table and Boolean equations. The instructor systematically builds the logic, showing how higher priority inputs override lower ones, which is essential for understanding digital system design where signal conflicts must be resolved deterministically.

Loading lesson…