Scribd
Upload
27 views23 pages

DLD Lecture 16

The document discusses binary ripple carry adders, signed binary numbers represented using 1's and 2's complement, and how to design combinational logic circuits from functional descriptions. Examples are provided of designing circuits to check if a binary number is less than 3, add 1 to a 4-bit number, and calculate the square of an input number.

Uploaded by

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

DLD Lecture 16

The document discusses binary ripple carry adders, signed binary numbers represented using 1's and 2's complement, and how to design combinational logic circuits from functional descriptions. Examples are provided of designing circuits to check if a binary number is less than 3, add 1 to a 4-bit number, and calculate the square of an input number.

Uploaded by

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

Digital Logic Design

Dr. Irfan Yousuf


Department of Computer Science (New Campus)
UET, Lahore
(Lecture # 16; April 16, 2020)
Outline
• Binary Ripple Adder
• Signed Addition & Subtraction
• Description to Implementation
Binary Ripple Carry Adder
• A parallel binary adder is a digital circuit that
produces the arithmetic sum of two binary numbers
using only combinational logic.

• The parallel adder uses n full adders in parallel, with


all input bits applied simultaneously to produce the
sum.

• The full adders are connected in cascade, with the


carry output from one full adder connected to the
carry input of the next full adder.
Binary Ripple Carry Adder
Binary Ripple Carry Adder
Signed Binary Numbers
• Signed Binary Numbers use the MSB as a sign bit to
display a range of either positive numbers or
negative numbers.
1’s Complement
• 1’s complement is another way of feeding the
negative binary number to the computer.
• In one’s complement method, the positive binary
numbers are unchanged.
• But the negative numbers are represented by taking
1’s complement of unsigned positive number.
• 1’s compliment of a number is created by replacing
all 0’s with 1’s & all 1’s with 0’s
1’s Complement
1’s Complement
2’s Complement
• To find the 2’s compliment of a binary number, first
we should find the 1’s compliment of that number
and later “1” is added to the 1’s compliment.
Signed Binary Numbers

- There is only one way to represent +9, we have two


different ways to represent -9 using eight bits:
Signed Binary Addition / Subtraction

- See Example 3.21 and 3.22


Combination Logic Design
• Implementation of a function from functional
description
Example 1
• Design a combinational circuit with three input and
one output. The output is equal to logic 1 when the
binary value of the input is less than 3. The output is
logic 0 otherwise.
Example 1
Example 2
• Design a combinational circuit that adds one to a 4-
bit binary number A3 A2 A1 A0. For example, if the
input of the circuit is 1101, THE OUTPUT IS 1110.
The circuit can be designed using four half adders.
Example 2
Example 2
Example 3
• Design a combinational circuit with three inputs and
six outputs. The output binary number should be the
square of the input binary numbers.
Example 3
Example 3
Example 3
Summary
• Combinational Logic Design

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy