Four-bit Parallel-Ripple Adder-Subractor

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/digital-electronics/combinational-circuit/cla-arithmetic-logic/asset-four-bit-parallel-ripple-adder-subractor 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 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…