Hardwired Control Unit
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- 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
- 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
- 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
- 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture focuses on the design and analysis of a hardwired control unit for a hypothetical computer system. The instructor begins by presenting a problem involving three 8-bit registers (A, B, C) and two instructions (I1, I2). A table outlines the required control signals for four micro-operations (T1 through T4). The core of the lesson involves deriving Boolean expressions for each control signal based on the table. The instructor then demonstrates how to implement these expressions using logic gates. Finally, the lecture transitions to the limitations of hardwired control and introduces the concept of a micro-programmed control unit as a more flexible alternative.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces a specific problem statement displayed on the screen: "Q Consider a hypothetical control unit implemented by hardware it uses three, 8-bits register A, B, C." He presents a table detailing the control signals required for micro-operations T1, T2, T3, T4 under instructions I1 and I2. He begins the derivation process by focusing on the signal Ain. He identifies the specific rows in the table where Ain is active, which are T1 under I1, T4 under I1, T3 under I2, and T4 under I2. He writes the initial Boolean expression on the whiteboard: Ain = I1 T1 + I1 T4 + I2 T3 + I2 T4. This establishes the method of summing the minterms where the signal is asserted.
2:00 – 5:00 02:00-05:00
Continuing the derivation, the instructor writes out the Boolean expressions for the remaining control signals. For Aout, he identifies the active conditions and writes Aout = I1 T4 + I2 T1 + I2 T2. He proceeds to list the other signals: Bin, Bout, Cin, Cout. To visualize the hardware implementation, he draws a logic diagram. This diagram includes a Sequence Counter (SC) and timing signals (T0 to T3) feeding into AND gates. The outputs of these gates are then combined using OR gates to generate the final control signals. He explains that the wiring of these logic elements determines the sequence of operations, which is the defining characteristic of a hardwired control unit. The diagram shows how the instruction decoder and timing signals interact to produce the necessary control lines for the registers.
5:00 – 8:42 05:00-08:42
The lecture shifts to a theoretical discussion about the nature of hardwired control. Text on the screen states, "The sequence of the operation carried out by this machine is determined by the wiring of the logic elements and hence named as 'hardwired'." The instructor highlights a key limitation: "any modification to the design require re-design & re-connection of H/W component." He explains that this lack of flexibility makes hardwired control unsuitable for complex or frequently changing designs. To resolve this, he introduces the "Micro-programmed control unit." He notes that the idea was introduced by Maurice Wilkes in 1951. The screen displays text explaining that microprograms are sequences of microinstructions stored in special control memory. The main advantage is the simplicity of structure and the ability to easily replace outputs. The instructor explains that binary patterns of control signals are stored in control memory, and hardware generates the signals after accessing a word from memory.
The video provides a comprehensive look at control unit design, moving from a concrete example to abstract concepts. It starts with the practical task of deriving control logic from a micro-operation table, showing how Boolean algebra translates to physical wiring. It then critically evaluates this hardwired approach, pointing out its rigidity. Finally, it offers the micro-programmed solution, which replaces complex wiring with stored instructions, thereby solving the flexibility problem. This progression effectively contrasts the two major methods of control unit implementation.

