Scribd
Upload
190 views

07-Chapter 7 - Logic Circuits

This document summarizes key concepts from Chapter 7 on logic circuits. It discusses positive logic levels, binary numbering systems, parallel and serial transmission of digital information, common logic gates, Boolean theorems, synthesis and minimization of logic circuits using Karnaugh mapping, and example problems for conversion between numbering systems and adding binary numbers. It also lists the assigned teams for an SFA Rover project.

Uploaded by

Jagadeesh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
190 views

07-Chapter 7 - Logic Circuits

This document summarizes key concepts from Chapter 7 on logic circuits. It discusses positive logic levels, binary numbering systems, parallel and serial transmission of digital information, common logic gates, Boolean theorems, synthesis and minimization of logic circuits using Karnaugh mapping, and example problems for conversion between numbering systems and adding binary numbers. It also lists the assigned teams for an SFA Rover project.

Uploaded by

Jagadeesh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 36

Chapter 7

Logic Circuits

Positive Logic
Logic 1

high, true, on 5 Volts

Really: 2.4 to 5 Volts

Logic 0

low, false, off 0 Volts


Really: 0 to 0.4 Volts

Logic X

dont care Really: 0.4 to 2.4 Volts

Binary Numbers
Bit

a single binary digit 8 bits 4 bits 8 million bits

Byte

Nibble

Megabyte

Transmission of Digital Information Parallel Transmission

an n-bit word is transferred on n wires plus a common or ground wire

Serial Transmission

the successive bits of a word are transferred one after another with a single pair of wires

TTL Logic Circuits


TTL = Transistor-Transistor Logic Logic Gates

AND OR NOT (inverter) NAND NOR XOR Equivalence Gate Buffer

bol Sym t cui e Cir abl T sion s uth pre Tr Ex n lea uts o Bo Inp e tipl l Mu

Numbering Systems
Binary Decimal Hexadecimal Octal Base Base Base Base 2 10 16 8

Numbering Systems
Why do we use the decimal system for everyday mathematics?

Answer: Fingers and Thumbs

Why do we use the binary system for computer mathematics?


Answer: Computers use voltage levels to perform mathematics. 0-Volts and 5-Volts correspond to 0s and 1s

Counting
Binary 0000 Decimal 0 Hexadecimal 0

To the chalk board...

Example Problem
Convert the binary number 1100 1010 to decimal and hexadecimal and octal.

More Examples
Convert 34310 to binary and hexadecimal and octal. Convert 1101.12 to decimal an octal. Convert 0.39210 to binary. Convert 317.28 to binary.

Exercises
Add these binary numbers: 1000.111 + 1100.011 What 2 kinds of logic gates are needed for computer addition?

Boolean Theorems
AA = ? A1 = ? A0 = ? AA = ? A = ? A(B + C) = ?

Boolean Theorems
A A A A + + + + A=? 1=? 0=? A = ?

De Morgans Theorems
(AB) = ? (A + B) = ? (ABC) = ? (A + B + C) = ?

7.4 Synthesis of Logic Gates


Find the sum-of-products for G for the truth table in Table P7.35 on page 370. Can the equation be simplified? If so, how many gates did we save? Repeat for Table 7.7.

7.5 Minimization of Logic Gates


Find the sum-of-products for the truth table in Table 7.8 on page 352. Can the equation be simplified? How many gates did we save? Is there a easier way to simplify these equations?

Karnaugh Mapping Steps


1. Sketch a Karnaugh map grid for the
problem. 2. Fill in the 1s and 0s from the truth table. 3. Circle groups of 1s. 4. Write an equation using these circles.

Problem P7.44, 46, 47, 48 or Table 7.49.

Chapter 7
Logic Circuits
Reminder: Remember to keep your graded labs for your lab portfolio.

Example Problem
What would be the truth table for the logic circuit shown in figure 4.18(a)?

A B

Example Problem
What would be the truth table for the logic circuit shown 14.8(b)?

A B

Team Exercise 4 Minutes


What would be the truth table for the logic circuit shown 14.8(c)?

A B

X Y

Team Exercise 4 Minutes


What would be the truth table for the logic circuit shown 14.8(d)?
A B

X Y

Exercises
P7.19 P7.20 P7.21,22,23

EGR215/PHY262 Seating Chart and Teams

Chris F.

Trevor

Michael

Billy

Jonathan B.

Carson

Shaun

Nathan

Ignacio

Lenz
Eric B. Levi Ben

Karnaugh
Charles Eric C.

Zener
Chris D. Allen

Mosfet
Chris W. Matt

Thevenin
Wally

Cory

Byron

Tim

Chris J.

Matt

Ryan

Kirchhoff
Korey Mason

Coulomb
Shepard Josh

Boolean
Jonathan V.

Note: These are the assigned teams for the SFA Rover project. Teams were assigned alphabetically and by lab section.

You might also like