Microprogrammed Control Unit

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-architecture/control-unit-design/hardwired-microprogrammed-cu/asset-microprogrammed-control-unit after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/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
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on Micro-Programmed Control Units, beginning with their historical introduction by Maurice Wilkes in 1951. The instructor explains that microprogramming serves as an intermediate level to execute computer program instructions, organizing outputs as sequences of microinstructions stored in special control memory. The lecture then transitions to a detailed comparison of Horizontal and Vertical micro-programming. Horizontal micro-programming is described as offering a higher degree of parallelism suitable for multi-processor systems, utilizing a control word where each bit directly corresponds to a control signal. Conversely, Vertical micro-programming is presented as a method that reduces control word size through encoding, though it limits parallelism to a maximum of one due to the decoder mechanism. The session concludes by noting that combinational units combining these approaches are preferred in most applications.

Chapters

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

    The lecture begins with a slide titled 'Micro-Programmed Control Unit'. The instructor introduces the concept, highlighting that the idea was introduced by Maurice Wilkes in 1951 as an intermediate level to execute computer program instructions. He underlines key phrases on the slide, including 'Maurice Wilkes', '1951', 'intermediate level', and 'microinstructions'. The text explains that microprograms are organized as a sequence of microinstructions stored in special control memory. The instructor emphasizes the main advantage: the simplicity of the structure, noting that outputs are organized in microinstructions and can be easily replaced. He further explains that binary patterns of control signals are stored in control memory, and hardware is used to generate the control signals after accessing a word from the memory.

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

    The topic shifts to 'Horizontal micro-Program'. The slide states that horizontal micro-programming provides a higher degree of parallelism and is suitable for multi-processor systems. A critical point highlighted is that it requires more bits for the control word, specifically '1 bit for every control signal'. The instructor draws a diagram illustrating this architecture. He sketches a control memory grid where rows represent microinstructions. He shows a Control Data Register (CDR) holding the control word, which is then fed into logic gates (AND gates) to generate specific control signals like ALU operations, register transfers, and memory control. The diagram visually demonstrates the direct mapping where a single '1' in the control word activates a specific hardware component without decoding.

  3. 5:00 – 7:08 05:00-07:08

    The lecture moves to 'Vertical Micro-program'. The slide explains that this method reduces the size of control words by encoding control signal patterns before storage. It offers more flexibility than horizontal micro-programming but has a maximum degree of parallelism of 1 due to the decoder. The instructor draws a diagram showing a 3x8 decoder. He illustrates how a 3-bit encoded input (e.g., 001, 010) selects one of the 8 output lines, which then activates a specific control signal. This contrasts with the horizontal approach. Finally, a 'Conclusion' slide appears, stating that the combinational Horizontal micro-Program and Vertical Micro-program controlled unit is preferred in most applications. The instructor underlines 'Horizontal micro-Program', 'Vertical Micro-program', and 'most application' to reinforce the final takeaway.

The video systematically builds an understanding of control unit design, starting from the foundational concept of microprogramming introduced in 1951. It effectively contrasts two primary implementation strategies: Horizontal and Vertical micro-programming. The horizontal approach prioritizes speed and parallelism by dedicating bits directly to signals, resulting in wider control words. In contrast, the vertical approach prioritizes compactness by encoding signals, which necessitates decoding and limits parallel execution. The synthesis of these concepts leads to the conclusion that modern systems often utilize a combinational approach, leveraging the benefits of both methods to optimize performance and flexibility in computer architecture.

Loading lesson…