Scribd
Upload
62 views

FPGA Based System Design: Week 3

This document provides an overview of an FPGA-based system design lecture. It covers revision of combination circuits, Boolean algebra, Venn diagrams, sum-of-products and product-of-sums forms, and K-mapping minimization techniques. The goal is for students to understand basic digital logic concepts and be able to analyze and design simple logic circuits using these concepts. Waveform analysis is also introduced as a technique for simulating and troubleshooting more complex FPGA-based designs.

Uploaded by

M. Amin Qureshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
62 views

FPGA Based System Design: Week 3

This document provides an overview of an FPGA-based system design lecture. It covers revision of combination circuits, Boolean algebra, Venn diagrams, sum-of-products and product-of-sums forms, and K-mapping minimization techniques. The goal is for students to understand basic digital logic concepts and be able to analyze and design simple logic circuits using these concepts. Waveform analysis is also introduced as a technique for simulating and troubleshooting more complex FPGA-based designs.

Uploaded by

M. Amin Qureshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

FPGA Based System Design

Week 3
Presentation Credit
The content for this lecture is taken from the book:
“Fundamentals of Digital Logic with Verilog Design, Stephen Brown and Zvonko
Vranesic, Department of Electrical and Computer Engineering, University of Toronto”

2
Learning Outcomes

• Revision of Combination Circuit


Students will be able to:
• Recall Boolean Algebra
• Understand Venn Diagrams
• Write Sum-of-Products and Product-of-Sums Forms
• Simplify Boolean functions using K-Mapping
Basic Logic Gates
Analysis of Digital Logic Circuits

We analyze logic circuits by putting arbitrary digital values


on the input signals.
Let us take x1 = x2 = 1 and x3 = 0

What would be the result of the output f ?


Analysis of Logic Circuits - Waveforms

Waveforms, although much basic concept in digital logic, is widely used in complex design and troubleshooting.
FPGA simulators use waveforms for simulation and troubleshooting purposes
Lecture Plan

• Revision of Combination Circuit


• Boolean Algebra
• Venn Diagram
• Sum-of-Products and Product-of-Sums Forms
• K-Mapping
Boolean Algebra

• Formualted by George Boole in 1849


• He used mathematical expression notation for processes involved in
logical thought and reasoning
• Further refinement made it possible for Boolean Algebra to be used in
Digital Logic
• Claude Shannon used Boolean Algebra in 1930s for switch based
circuits
Axioms of Boolean Algebra
Boolean Algebra for Single Variable
Properties of Boolean Algebra
DeMorgan’s Theorem
Lecture Plan

• Revision of Combination Circuit


• Boolean Algebra
• Venn Diagram
• Sum-of-Products and Product-of-Sums Forms
• K-Mapping
Venn Diagrams
Venn Diagrams
Venn Diagrams
Venn Diagrams

• Revision of Combination Circuit


• Boolean Algebra
• Venn Diagram
• Sum-of-Products and Product-of-Sums Forms
• K-Mapping
Mintems and Maxterms from Truth Table
NAND as Universal Logic
NOR as Universal Logic
From Truth Table to SOP Circuit
From Truth Table to POS Circuit
Lecture Plan

• Revision of Combination Circuit


• Boolean Algebra
• Venn Diagram
• Sum-of-Products and Product-of-Sums Forms
• K-Mapping
K-Map Minimization

Can you write down the expression and draw the combined circuit for both the functions in
above example?
Digital Logic Function

Product AND (&)


3 Inputs Sum OR (|)

Black Box Truth Table SUM of PRODUCTS

Boolean Logic Minimisation

Connect Standard Logic Chips


Very Simple Glue Logic

FIXED Logic

Transistor Switches
Review Questions
• Use the Venn diagram to prove DeMorgan’s theorem
• Use algebraic manipulation to prove that (x + y) · (x + y’) = x
• Design the simplest circuit that implements the function f (x1, x2,
x3) = Ʃm(1, 3, 4, 6, 7) using NAND gates.

You might also like