# Programming Logic Gate Functions in PLCs

Download Programming Logic Gate Functions in PLCs

## Preview text

Chapter

7

Programming Logic Gate Functions in PLCs

This presentation will focus on the material needed for this PLC class. The text covers logic theory beyond the scope of this PLC course. The Digital Electronics class at GCCC covers the material in chapter 7 in detail. You will only be studying selected pages from chapter 7 of the text.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Objectives

We will focus on the following:

• Describe combinational and sequential logic gate circuits.

• Create PLC ladder logic programs for NOT (inverter), AND, OR,, XOR, logic gates.

• Convert Boolean expressions to PLC ladder logic diagrams.

• Convert PLC ladder logic diagrams to logic gate circuits and Boolean expressions.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Combinational Logic Gates

• Do not require clock pulses to operate. • Outputs depend only on their inputs. • Outputs are generated instantaneously. • Simply called logic gates.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Logic Gates

• NOT. • AND. • OR. • NAND. • NOR. • XOR (exclusive OR). • XNOR (exclusive NOR).

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Sequential Logic Devices

• Have outputs that depend on their inputs as well as time.

• Require clock pulses. • An inherent delay time is always

present. • Flip-flop devices.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Sequential Logic Circuit

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Boolean Expressions

• Every gate logic function has its own equation called a Boolean expression

• Boolean algebra:

– Two states are true and false.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Boolean Expressions (Cont.)

• True state: (1)

– Represented by the number one, called logic high or logic one in Boolean algebra.

• False state: (0)

– Represented by the number zero, called logic low or logic zero.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

7

Programming Logic Gate Functions in PLCs

This presentation will focus on the material needed for this PLC class. The text covers logic theory beyond the scope of this PLC course. The Digital Electronics class at GCCC covers the material in chapter 7 in detail. You will only be studying selected pages from chapter 7 of the text.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Objectives

We will focus on the following:

• Describe combinational and sequential logic gate circuits.

• Create PLC ladder logic programs for NOT (inverter), AND, OR,, XOR, logic gates.

• Convert Boolean expressions to PLC ladder logic diagrams.

• Convert PLC ladder logic diagrams to logic gate circuits and Boolean expressions.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Combinational Logic Gates

• Do not require clock pulses to operate. • Outputs depend only on their inputs. • Outputs are generated instantaneously. • Simply called logic gates.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Logic Gates

• NOT. • AND. • OR. • NAND. • NOR. • XOR (exclusive OR). • XNOR (exclusive NOR).

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Sequential Logic Devices

• Have outputs that depend on their inputs as well as time.

• Require clock pulses. • An inherent delay time is always

present. • Flip-flop devices.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Sequential Logic Circuit

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Boolean Expressions

• Every gate logic function has its own equation called a Boolean expression

• Boolean algebra:

– Two states are true and false.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

Boolean Expressions (Cont.)

• True state: (1)

– Represented by the number one, called logic high or logic one in Boolean algebra.

• False state: (0)

– Represented by the number zero, called logic low or logic zero.

© Goodheart-Willcox Co., Inc.

Permission granted to reproduce for educational use only.

## Categories

## You my also like

### CS61c: Representations of Combinational Logic Circuits

347.8 KB30.9K6.2K### Boolean Function and Expression

65.1 KB59.9K21K### Digital Electronic Engineering

939.8 KB51.9K19.7K### Building Circuits with Logic Gates to Demonstrate Mathematical

491.1 KB28.5K6.3K### Design Of Alu Using Reversible Gates And Vectored

424.7 KB74.3K16.4K### Logic gates AND, OR, NOT

566.6 KB5.4K1.8K### Logic gates Logic gates and truth tables

80.6 KB2.3K809### The Stone Representation Theorem For Boolean Algebras

271.8 KB49.9K15.5K### On The Relationship Between Projective Distributive Lattices

153.1 KB30.7K6.1K