Hardwired Control Unit

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/digital-computer-organization-and-architecture/control-unit-design/hardwired-microprogrammed-cu/asset-hardwired-control-unit after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, 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 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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

  1. 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. 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.

  3. 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.

Loading lesson…