Scribd
Upload
9 views3 pages

Discusion 1

Uploaded by

fmisomali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views3 pages

Discusion 1

Uploaded by

fmisomali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Let me dive into the fascinating world of binary addition and explore how logic gates

play a crucial role in designing arithmetic circuits. I will break down the steps to create a
2-bit binary adder using basic logic gates.

Binary Addition and the Binary Adder

Binary Addition Basics

A Binary Adder is a digital circuit that implements the arithmetic sum of two
binary numbers supported with any length is known as a binary adder. It is
generated using full-adder circuits connected in sequence. The output carries
from one full-adder linked to the input carry of the next full-adder( Tutorials
Point, 2021, para 1)

Binary addition follows similar principles to decimal addition, but with only two digits: 0
and 1. When adding binary numbers, we generate a carry when the sum equals or
exceeds 2 (1 + 1). This carry is then propagated to the next column for subsequent
additions.

2. Binary Adder Circuit

A binary adder is a digital circuit that computes the sum of two binary numbers. We’ll
focus on a 1-bit binary adder for simplicity. The basic building blocks for this adder are
AND and XOR gates. (Admin, 2023)

Let me break it down:

 Inputs: Two single-bit binary numbers, A and B.


 Outputs:
o SUM (S): The result of the addition.
o Carry ©: A carry-out bit for subsequent additions.

3. Binary Adder Truth Table

The truth table for our 1-bit binary adder resembles an Exclusive-OR (XOR) gate.
Here’s the truth table:

A B S C

0 0 0 0

0 1 1 0
A B S C

1 0 1 0

1 1 0 1

4. Circuit Diagram

The 1-bit binary adder circuit can be represented as follows:

A ----> AND Gate ----> XOR Gate ----> S (SUM)


B ----> | /
OR Gate
C (Carry) ---/

5. Step-by-Step Explanation

1. AND Gate: The AND gate takes inputs A and B. If both A and B are 1, it
produces a 1; otherwise, it outputs 0.
2. XOR Gate: The XOR gate computes the sum (S). It produces a 1 when either A
or B (but not both) is 1.
3. Carry(C): The carry-out bit © is generated when A and B are both 1 (1 + 1). It’s
passed to the next column for subsequent additions.

6. Behavior Analysis

 When A = 0 and B = 0, S = 0, and C = 0 (no carry).


 When A = 1 and B = 0, S = 1, and C = 0 (no carry).
 When A = 0 and B = 1, S = 1, and C = 0 (no carry).
 When A = 1 and B = 1, S = 0, and C = 1 (carry).

Question for Discussion

What other applications can you think of for binary adders beyond arithmetic
operations? How do they contribute to digital circuits?

References:
Admin, May 16, 2023, Parallel Binary Adder Circuit - Digital Integrated Circuits
https://digial-ic.com/parallel-binary-adder-circuit/

Tutorials Point (July 24, 2021). What is Binary Adder? - Online Tutorials Library
https://www.tutorialspoint.com/what-is-binary-adder2

You might also like