1 / 56

# COS 250 Discrete Structures - PowerPoint PPT Presentation

COS 250 Discrete Structures. Assoc. Prof. Svetla Boytcheva Spring semester 2011. Lecture № 10. Boolean Algebra. Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits. Boolean Algebra.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' COS 250 Discrete Structures' - cora-bailey

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### COS 250Discrete Structures

Assoc. Prof. Svetla Boytcheva

Spring semester 2011

### Lecture № 10

Boolean Algebra

• Boolean Functions

• Representing Boolean Functions

• Logic Gates

• Minimization of Circuits

The basic rules for simplifying and combining logic gates are called Boolean algebra in honour of George Boole (1815 – 1864) who was a self-educated English mathematician who developed many of the key ideas.

FIGURE 1

f0

f1

f2

f3

0

1

0

0

0

1

1

0

1

1

n=1 - Boolean functions with 1 argument

f0(x)= const 0

f1 (x)=xidentity

f2 (x)= not xnegation (denotes like  xor)

f3 (x)= const 1

f0

f1

f2

f3

f4

f5

f6

f7

f8

f9

f10

f11

f12

f13

f14

f15

0 0

0 1

1 0

1 1

0

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

1

0

1

1

0

0

1

1

1

1

0

0

0

1

0

0

1

1

0

1

0

1

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

n=2 - Boolean functions with 2 arguments

• f0(x,y)=0;

• f1(x,y)=x۸y - conjunction; (denotes like xy)

• f3(x,y)=x;

• f5(x,y)=y;

f0

f1

f2

f3

f4

f5

f6

f7

f8

f9

f10

f11

f12

f13

f14

f15

0 0

0 1

1 0

1 1

0

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

1

0

1

1

0

0

1

1

1

1

0

0

0

1

0

0

1

1

0

1

0

1

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

n=2

f6(x,y)=xy

f7(x,y)=x v y -

f8 (x,y)=x↓y-Pears

f9(x,y)= xy –equivalence (xy or xy )

f0

f1

f2

f3

f4

f5

f6

f7

f8

f9

f10

f11

f12

f13

f14

f15

0 0

0 1

1 0

1 1

0

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

1

0

1

1

0

0

1

1

1

1

0

0

0

1

0

0

1

1

0

1

0

1

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

n=2

• f10(x,y)=not y;

• f11(x,y)=y →x –reverse implication

• f12(x,y)=not x

• f13(x,y)=x →y –implication ‏

f0

f1

f2

f3

f4

f5

f6

f7

f8

f9

f10

f11

f12

f13

f14

f15

0 0

0 1

1 0

1 1

0

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

1

0

1

1

0

0

1

1

1

1

0

0

0

1

0

0

1

1

0

1

0

1

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

n=2

f14(x,y)=x|y-Sheffer function

f15(x,y)=1;

f2 and f4not named - presents as

In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written "|" or "↑", denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called the alternative denial, since it says in effect that at least one of its operands is false. In Boolean algebra and digital electronics it is known as the NAND operation ("not and").

Charles Sanders Peirce (September 10, 1839 – April 19, 1914) was an American philosopher, logician, mathematician, and scientist, born in Cambridge, Massachusetts. In 1880 he discovered how Boolean algebra could be done via a repeated sufficient single binary operation (logical NOR)

The Peirce arrow,symbol for "(neither)...nor...", also called the Quine dagger.

Boolean functions with 1 argument

FIGURE 1 Basic Types of Gates.

AND, OR and NOT represented byNAND

FIGURE 2 (11.3)

FIGURE 2 Gates with n Inputs.

FIGURE 3 (11.3)

FIGURE 3 Two Ways to Draw the same Circuit.

FIGURE 4 (11.3)

FIGURE 4 Circuits that Produce the Outputs Specified in Example.

FIGURE 5 (11.3)

FIGURE 5 A Circuit for Majority Voting.

FIGURE 6 (11.3)

FIGURE 6 A Circuit for a Light Controlled by Two Switches.

FIGURE 7 (11.3)

FIGURE 7 A Circuit for a Fixture Controlled by Three Switches.

FIGURE 8 (11.3)

FIGURE 9 (11.3)

P. 765

TABLE 4 (11.3)

P. 765

FIGURE 10 (11.3)

P. 765

FIGURE 1 (11.4)

FIGURE 1 Two Circuits with the Same Output.

P. 767

http://www.chem.uoa.gr/applets/appletgates/appl_gates2.html

http://www.ee.surrey.ac.uk/Projects/Labview/Sequential/Course/01-Decoder/index.htm