Scribd
Upload
24 views14 pages

Lecture 4

This document discusses various types of combinational and sequential logic circuits. It explains combinational logic circuits have outputs that only depend on current inputs, while sequential logic circuits have outputs that depend on current and previous inputs. The document then provides details on designing half adders, full adders, binary subtractors, multipliers and BCD adders. Circuit diagrams and truth tables are presented for each logic component.

Uploaded by

Ali Ahmad
Copyright
© Attribution Non-Commercial (BY-NC)
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
24 views14 pages

Lecture 4

This document discusses various types of combinational and sequential logic circuits. It explains combinational logic circuits have outputs that only depend on current inputs, while sequential logic circuits have outputs that depend on current and previous inputs. The document then provides details on designing half adders, full adders, binary subtractors, multipliers and BCD adders. Circuit diagrams and truth tables are presented for each logic component.

Uploaded by

Ali Ahmad
Copyright
© Attribution Non-Commercial (BY-NC)
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

Combinational Logic

Combinational Logic: Output only depends on current input

Sequential Logic:Output depends on current and previous inputs

Design Procedure
[Link] number of inputs and outputs? [Link] the truth table [Link] the Boolean Function [Link] the logic diagram, verify correctness

Half Adder circuit

Full Adder?
Truth Table:

xyz 000 001 010 011 100 101 110 111

CS 00 01 01 10 01 10 10 11

Full Adder Circuit

Full Adder Circuit

Half adder ?

4-bit Adder Circuit

But this is slow...

Binary Subtractor
Subtraction is done by using complements

As 2s Complement = A+1
A-B= A + B+1

4-bit adder subtractor

Binary Multiplier
Binary mult. Is done the same way of decimal mult.

Multiplicand is multiplied by each bit of the multiplier.

10

Binary Multiplier

11

4-bit by 3-bit Binary Multiplier

B3 B2 B1 B0 A2 A1 A0 A0B3 A0B2 A0B1 A0B0 A1B3 A1B2 A1B1 A1B0

A2B3 A2B2 A2B1 A2B0

12

BCD adder
Numbers that need correction (add 6) are: 01010 (10) 01011 (11) 01100 (12) 01101 (13) 01110 (14) 01111 (15) 10000 (16) 10001 (17) 10010 (18) 10011 (19) Decides to add 6?

Adds 6

13

BCD adder
Numbers that need correction (add 6) are: K Z8 Z4 Z2 Z1 0 1 0 1 0 (10) 0 1 0 1 1 (11) 0 1 1 0 0 (12) 0 1 1 0 1 (13) 0 1 1 1 0 (14) 0 1 1 1 1 (15) 1 0 0 0 0 (16) 1 0 0 0 1 (17) 1 0 0 1 0 (18) 1 0 0 1 1 (19)

C = K + Z8Z4 +Z8Z2

14

You might also like