[go: up one dir, main page]
Scribd
Upload
72 views17 pages

C O A CSE 203: Omputer Rganization AND Rchitecture

This document provides an overview of Lecture 2 from the course Computer Organization and Architecture CSE 203. It discusses digital logic circuits and Boolean algebra. Boolean algebra deals with binary variables and logic operations like AND, OR, and complement. It can be used to express the relationships between variables in logic diagrams and simplify circuit design. Techniques like Karnaugh maps can be used to minimize the number of logic gates needed to implement a Boolean function. Don't care conditions can also be included in Karnaugh maps during the simplification process.

Uploaded by

saifsunny
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
72 views17 pages

C O A CSE 203: Omputer Rganization AND Rchitecture

This document provides an overview of Lecture 2 from the course Computer Organization and Architecture CSE 203. It discusses digital logic circuits and Boolean algebra. Boolean algebra deals with binary variables and logic operations like AND, OR, and complement. It can be used to express the relationships between variables in logic diagrams and simplify circuit design. Techniques like Karnaugh maps can be used to minimize the number of logic gates needed to implement a Boolean function. Don't care conditions can also be included in Karnaugh maps during the simplification process.

Uploaded by

saifsunny
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/ 17

COMPUTER ORGANIZATION AND

ARCHITECTURE
CSE 203

LECTURE 2

CHAPTER 1: DIGITAL LOGIC CIRCUITS


DIGITAL COMPUTER

 The digital computer is a digital system that


performs various computational tasks.
DIGITAL COMPUTER

 c
LOGIC GATES
LOGIC GATES
BOOLEAN ALGEBRA

 Boolean algebra is an algebra that deals with


binary variables and logic operations.
 Three basic logic operations – AND, OR,
Complement
 Example Boolean function:
 F=x+y z
BOOLEAN ALGEBRA

The purpose of the Boolean algebra is to


facilitate the analysis and design of digital
circuit. It provides a convenient tool to:
1. Express in algebraic form a truth table
relationship between binary variables.
2. Express in algebraic form the input-output
relationship of logic diagrams.
3. Find simpler circuits for the same function
BOOLEAN ALGEBRA
BASIC IDENTITIES OF BOOLEAN ALGEBRA
LOGIC DIAGRAM OF SAME FUCNTION
MAP SIMPLIFICATION

 More the complexity of algebraic expression


means more the complexity of logic diagram
 Karnaugh map or K-map
 Method provides simple, straightforward
procedure for simplifying Boolean function
 Minimum number of terms needed to
express the function
MAP SIMPLIFICATION

 Minterm: Each combination of the variable


in the truth table is called a minterm.
 Following truth table has 8 minterms:

 The minterms can be expressed as:


 F(x,y,z) =
MAPS OF MULTIPLE VARIABLES
K-MAP FOR SIMPLIFIED FUNCTION

 Minterms:
 F(A, B, C, D) =


K-MAP SIMPLIFICATION

‘Sum-of-Product’

‘Product-of-Sum’
DON’T-CARE CONDITION
K-MAP SIMPLIFICATION

Consider the following boolean function together with


don’t-care minterms.

Expression is:
THANK YOU
17

You might also like