Hardwired Control Unit

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full 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…