{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Ch03_ECOA4e REVISED 10_2014 - Chapter 3 Boolean Algebra and...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 3 Boolean Algebra and Digital Logic
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how digital circuits work together to form complex computer systems.
Background image of page 2
3 In the latter part of the nineteenth century, George Boole incensed philosophers and mathematicians alike when he suggested that logical thought could be represented through mathematical equations . How dare anyone suggest that human thought could be encapsulated and manipulated like an algebraic formula? Computers, as we know them today, are implementations of Boole’s Laws of Thought . John Atanasoff and Claude Shannon were among the first to see this connection. 3.1 Introduction
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4 In the middle of the twentieth century, computers were commonly known as “thinking machines” and “electronic brains.” Many people were fearful of them. Nowadays, we rarely ponder the relationship between electronic digital computers and human logic. Computers are accepted as part of our lives. Many people, however, are still fearful of them. In this chapter, you will learn the simplicity that constitutes the essence of the machine. 3.1 Introduction
Background image of page 4
5 3.2 Boolean Algebra Boolean algebra is a mathematical system for the manipulation of variables that can have one of two values. In formal logic, these values are “true” and “false.” In digital systems, these values are “on” and “off,” 1 and 0, or “high” and “low.” Boolean expressions are created by performing operations on Boolean variables. Common Boolean operators include AND, OR, and NOT.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
6 A Boolean operator can be completely described using a truth table. The truth table for the Boolean operators AND and OR are shown at the right. The AND operator is also known as a Boolean product. The OR operator is the Boolean sum. 3.2 Boolean Algebra
Background image of page 6
7 The truth table for the Boolean NOT operator is shown at the right. The NOT operation is most often designated by a prime mark ( X ). It is sometimes indicated by an overbar ( ) or an “elbow” ( X ). 3.2 Boolean Algebra
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
8 A Boolean function has: At least one Boolean variable, At least one Boolean operator, and At least one input from the set {0,1}. It produces an output that is also a member of the set {0,1}. Now you know why the binary numbering system is so handy in digital systems . 3.2 Boolean Algebra
Background image of page 8
9 The truth table for the Boolean function: is shown at the right. To make evaluation of the Boolean function easier, the truth table contains extra (shaded) columns to hold evaluations of subparts of the function. 3.2 Boolean Algebra
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10 As with common arithmetic, Boolean operations have rules of precedence.
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}