Four-bit Parallel-Ripple Adder-Subractor

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/digital-electronics/combinational-circuit/adders-subtractors/asset-four-bit-parallel-ripple-adder-subractor 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.

The lecture explains the implementation of a four-bit ripple adder/subtractor. It begins by defining subtraction as adding the 2's complement of the subtrahend to the minuend. The process involves finding the 1's complement via inverters and adding 1 via the input carry. A numerical example of 11 - 5 is worked out step-by-step to demonstrate the binary arithmetic. Finally, the circuit diagram is presented, showing how XOR gates and a control signal can switch the circuit between addition and subtraction modes. This covers the theoretical basis and practical hardware realization.

Chapters

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

    The instructor introduces the concept of subtraction using 2's complement. On-screen text states that A - B is done by taking the 2's complement of B and adding it to A. He writes the binary for 11 (1011) and 5 (0101). He sets up the problem as (+11) + (-5). He begins calculating the 2's complement of 5 by finding the 1's complement (1010) and adding 1 to get 1011, which represents -5 in 4-bit 2's complement notation. He emphasizes that the 1's complement is implemented with inverters. He writes "11 - 5" and "(+11) + (-5)" to clarify the operation.

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

    The instructor continues the numerical example. He writes 5 as 00101 (5 bits for clarity). He finds the 1's complement as 11010. He adds 1 to get 11011 (which is -5). He then adds this to 11 (01011). The binary addition 01011 + 11011 results in 100110. He discards the final carry bit, leaving 00110, which is 6 in decimal, confirming 11 - 5 = 6. He explicitly writes the intermediate steps of the addition to show how the carry propagates. He circles the result to highlight the final answer.

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

    The instructor presents the circuit diagram for a 4-bit ripple adder/subtractor. He explains that inverters (implemented as XOR gates) are placed between data input B and the full adder inputs. A control line labeled "Subtraction" is connected to the XOR gates and the initial Carry In (Cin). When the control is high (1), the XOR gates invert B (creating 1's complement) and Cin is set to 1, effectively adding 1 to form the 2's complement. This allows the adder to perform A - B. When the control is low (0), the circuit performs standard addition A + B. He points to the specific gates and connections to illustrate the flow. He draws circles around the XOR gates to emphasize their role.

The lesson effectively bridges the gap between mathematical theory and digital logic implementation. It starts with the fundamental arithmetic rule that subtraction is equivalent to adding the 2's complement. The instructor validates this with a concrete binary arithmetic example (11 - 5), carefully showing the inversion and carry addition steps. The final segment translates this logic into hardware, demonstrating how a single adder circuit can be repurposed for subtraction using XOR gates as controlled inverters and a control signal to manage the input carry. This unified approach is crucial for understanding ALU design and efficient circuit usage.

Loading lesson…