Scribd
Upload
66 views12 pages

Combinational Logic Design Basics

The document provides an overview of combinational logic design principles, emphasizing that outputs depend solely on current inputs without feedback loops. It covers combinational circuit analysis methods, Boolean algebra, and key definitions related to logic expressions and equations. Additionally, it introduces axioms and theorems relevant to logic operations, setting the stage for further study in subsequent chapters.

Uploaded by

Assad Leo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
66 views12 pages

Combinational Logic Design Basics

The document provides an overview of combinational logic design principles, emphasizing that outputs depend solely on current inputs without feedback loops. It covers combinational circuit analysis methods, Boolean algebra, and key definitions related to logic expressions and equations. Additionally, it introduces axioms and theorems relevant to logic operations, setting the stage for further study in subsequent chapters.

Uploaded by

Assad Leo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

ECE 2110: Introduction to Digital

Systems

Combinational Logic Design Principles


Combinational logic circuit
Outputs depend only on the current inputs
(Not on history)

Contain an arbitrary number of logic gates


and inverters, but NO feedback loops.

2
Combinational-Circuit Analysis
Kinds of combinational analysis:
 exhaustive (truth table)
 algebraic (expressions)
 simulation / test bench ( not in this course)
Write functional description in HDL
Define test conditions / test vectors
Compare circuit output with functional description (or
known-good realization)
Repeat for “random” test vectors

3
Switching algebra
“Boolean algebra”
deals with Boolean values -- 0, 1
Positive-logic convention
analog voltages LOW, HIGH --> 0, 1
Negative logic -- seldom used
Signals denoted by symbolic variables
(X, Y, FRED, etc.)

4
Boolean operators

Complement: X (opposite of X)
AND: X  Y binary operators, described
OR: X+Y functionally by truth table.

5
Logic symbols

6
Some definitions

Literal: a variable or its complement


 X, X, FRED, CS_L
Expression: literals combined by
AND, OR, parentheses, complementation
 X+Y
P  Q  R
A + B  C
 ((FRED  Z) + CS_L  A  B  C + Q5)  RESET
Equation: Variable = expression
 P = ((FRED  Z) + CS_L  A  B  C + Q5)  RESET
7
Axioms (postulates)

A1) X=0 if X‡1 A1’ ) X=1 if X‡0


A2) if X=0, then X’=1 A2’ ) if X=1, then X’=0
A3) 0 • 0=0 A3’ ) 1+1=1
A4) 1 • 1=1 A4’ ) 0+0=0
A5) 0 • 1= 1 • 0 =0 A5’ ) 1+0=0+1=1

Logic multiplication and addition


precedence
8
Theorems (Single variable)

Proofs by perfect induction

9
Two- and three- variable Theorems

10
Summary

Variables, expressions, equations


Axioms (A1-A5 pairs)
Theorems (T1-T11 pairs)
Single variable
2- or 3- variable
Prime, complement, logic
multiplication/addition, precedence
11
Next…

Chapter 4.1,4.2
N-variable theorem, DeMorgan’s
theorems
Standard representations of logic
functions

HW #4
12

You might also like