Scribd
Upload
130 views26 pages

Rangkaian Aritmatika

The document discusses single-bit adder circuits and multi-bit adder implementations. It describes the half adder and full adder circuits, their logic equations, and how they are used as building blocks for multi-bit adders. It then covers two implementations of multi-bit adders: the ripple carry adder and carry lookahead adder. The ripple carry adder uses cascaded full adders but has delay that grows linearly with the number of bits. The carry lookahead adder aims to increase speed by manipulating the boolean algebra.

Uploaded by

Farhan Nur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
130 views26 pages

Rangkaian Aritmatika

The document discusses single-bit adder circuits and multi-bit adder implementations. It describes the half adder and full adder circuits, their logic equations, and how they are used as building blocks for multi-bit adders. It then covers two implementations of multi-bit adders: the ripple carry adder and carry lookahead adder. The ripple carry adder uses cascaded full adders but has delay that grows linearly with the number of bits. The carry lookahead adder aims to increase speed by manipulating the boolean algebra.

Uploaded by

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

Pertemuan 14

ADDER
Single-bit Adder Circuits

The Half Adder (HA)

ECE 301 - Digital Electronics 2


Binary Addition

0 0 1 1
+ 0 + 1 + 0 + 1
0 1 1 10

Carry Sum
Sum

3
The Half Adder

4
The Half Adder

5
Single-bit Adder Circuits

The Full Adder (FA)

6
Binary Addition

0 0 0 0
0 0 1 1
+ 0 + 1 + 0 + 1
0 1 1 10
Carry-in

1 1 1 1
0 0 1 1
+ 0 + 1 + 0 + 1
1 10 10 11

Carry-out Sum

7
Cin Cout

8
The Full Adder

S Cout
Cin Cin

Cin Cin

S = X xor Y xor Cin


Cout = X.Y + X.Cin + Y.Cin

9
The Full Adder

X
A

B
Y S

Cin

Cout

10
Persamaan HA :
S = A XOR B
Cout = AB

Persamaan FA
S = A XOR B XOR Cin

Cout = AB + AC in + Bcin
The Full Adder
Half Adder Half Adder

Cin

Cin
Cin + xy

Cin
Multi-bit Adder Circuits

ECE 301 - Digital Electronics 13


Implementations of Multi-bit Adders:

1. Ripple Carry Adder


2. Carry Lookahead Adder

ECE 301 - Digital Electronics 14


Multi-bit Adder Circuits

Ripple Carry Adder

ECE 301 - Digital Electronics 15


Ripple Carry Adder
Carry ripples from one column to the next

1 1 1 Carry-in

1 0 1 0
+ 1 0 0 1
Carry-out 1 0 1 0 0

ECE 301 - Digital Electronics 16


Ripple Carry Adder 4 bit
Carry-out
Carry-in

Carry ripples from one stage to the next

ECE 301 - Digital Electronics 17


BCD ADDER

1. Buat Tabel Penjumlahan


2. Koreksi
Soal

Rancanglah Ripple Carry Adder 3 bit


Ripple Carry Adder
 n-bit Ripple Carry Adder
 Composed of n 1-bit Full Adders
 Carries ripple from LSB stage to MSB stage
 Delay ~ (n)*(delay of single FA stage)
 Area required is linear in n
 4-bit Ripple Carry Adder
 Composed of 4 1-bit Full Adders

ECE 301 - Digital Electronics 22


The Ripple Carry Adder is slow!

Why?

How can the speed of the adder be increased?

ECE 301 - Digital Electronics 23


Increasing the speed of the Adder

Method A: Include all inputs and outputs in the design
 Inputs = Xi, Yi, Cin,i; Outputs = Si, Cout,i

1-bit 3 inputs 2 outputs
Use Truth Table

2-bit 5 inputs 3 outputs and K-Map to
derive logic functions

4-bit 9 inputs 5 outputs

n-bit 2n+1 inputs n+1 outputs
 Large number of operands, but only 2 logic levels

Increase in speed decrease propagation delay

Increase in area required increase # of logic gates

ECE 301 - Digital Electronics 24


Increasing the speed of the Adder

Method B: Manipulate the Boolean Algebra

(results in the design of the Carry Lookahead Adder)

ECE 301 - Digital Electronics 25


Multi-bit Adder Circuits

Carry Lookahead Adder

ECE 301 - Digital Electronics 26

You might also like