Scribd
Upload
34 views

Gates

Here is the logic circuit for the function X  (A  B)  (AB): [CIRCUIT DIAGRAM] The circuit contains two AND gates and one OR gate. The inputs A and B are fed into an OR gate and an AND gate. The outputs of the OR and AND gates are then fed into a third AND gate which produces the final output X.

Uploaded by

Appraku Stephen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

Gates

Here is the logic circuit for the function X  (A  B)  (AB): [CIRCUIT DIAGRAM] The circuit contains two AND gates and one OR gate. The inputs A and B are fed into an OR gate and an AND gate. The outputs of the OR and AND gates are then fed into a third AND gate which produces the final output X.

Uploaded by

Appraku Stephen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 44

SCS 309

Digital Systems
Digital Systems
• Binary Quantities and Variables
• Number Systems and Binary Arithmetic
• Numeric and Alphabetic Codes
• Logic Gates
• Boolean Algebra
• Combinational Logic
Introduction
• Digital systems are concerned with digital signals
• Binary signal is the most common form of digital
signals
• Could be used individually
• To represent a single binary quantity or the state of a single switch
• can be used in combination
• To represent more complex quantities
Binary Quantities and Variables
• A binary quantity is one that can take only 2 states

S L
OPEN OFF
CLOSED ON

S L
0 0
1 1
A simple binary arrangement
A truth table
Binary Quantities and Variables
• A binary arrangement with two switches in series

L = S1 AND S2
Binary Quantities and Variables
• A binary arrangement with two switches in parallel

L = S1 OR S2
Binary Quantities and Variables
• Three switches in series

L = S1 AND S2 AND S3
Binary Quantities and Variables
• Three switches in parallel

L = S1 OR S2 OR S3
Binary Quantities and Variables
• A series/parallel arrangement

L = S1 AND (S2 OR S3)


Exercise - 3
• Representing an unknown network
Logic Gates
• A gate is a small electronic device that performs a simple electrical
function
• Gates are made from one or more transistors
• The building blocks used to create digital circuits are logic gates
• There are three elementary logic gates and a range of other simple
gates
• Each gate has its own logic symbol which allows complex functions
to be represented by a logic diagram
• The function of each gate can be represented by a truth table or
using Boolean notation
• The AND gate
• In order for Vcc to go to ground, it will require both transistors to
be "on", i.e., V1 and V2 both set high
• If either V1 or V2 is low then Vout will be high
Gates
• The OR gate
• +Vcc will go to ground and Vout will be low if either V1 or V2 is set
to high

• Thus, to get a high value on Vout it needs both V1 and V2 to be low


Gates
• The NOT gate (or inverter)
Gates
• A logic buffer gate
Gates

• The NAND gate


Gates
• The NOR gate
Gates

• The Exclusive OR gate


Gates

• The Exclusive NOR gate


Boolean Algebra
Benefits
• All binary operators can be chained together to implement a wide
function of any number of inputs

• Boolean equations are invaluable when designing digital logic

• Boolean equations simplify logic circuits and eliminates unnecessary


components
Boolean Algebra
• Boolean Constants
• these are ‘0’ (false) and ‘1’ (true)
• Boolean Variables
• variables that can only take the vales ‘0’ or ‘1’
• Boolean Functions
• each of the logic functions (such as AND, OR and NOT) are
represented by symbols as described above
• Boolean Theorems
• a set of identities and laws
Boolean Algebra
Properties
• Boolean algebra has quite a number of properties. The basic
ones are:
• commutative
• associative and
• distributive properties
Commutative
A & B = B & A and A + B = B + A
Associative
(A & B) & C = A & (B & C) and (A + B) + C = A + (B + C)
Distributive
A & (B + C) = A & B + A & C
Boolean Algebra
• Also, the Boolean algebra has quite a number of identities.
• Two basic identities worth taking notice of, are:
• A & A = 0 and
• A+A=1
• The first identity states that, the product of any variable and its
logical negation must always be false
• The second identity states that, the sum of any variable and its
logical negation must always be true
Gates
• The aforementioned identities and properties could be used to
simplify logic circuits.
Example
A & B & C + A & B & C = A & B & (C + C)
= A & B & (1)
=A&B
• Boolean identities

AND Function OR Function NOT function


00=0 0+0=0 0 1
01=0 0+1=1 1 0
10=0 1+0=1 AA
11=1 1+1=1
A0=0 A+0=A
0A=0 0+A=A
A1=A A+1=1
1A=A 1+A=1
AA=A A+A=A
A A  0 A  A 1
• Boolean laws

Commutative law Absorption law

AB  BA A  AB  A
AB B A A( A  B )  A

Distributive law De Morgan’s law


A(B  C )  AB  BC A B  AB
A  BC  ( A  B )( A  C ) AB  A B

Associative law Note also

A(BC )  ( AB )C A  AB  A  B
A  (B  C )  ( A  B )  C A( A  B)  AB
Combinational Logic
• Digital systems may be divided into two broad categories:
• combinational logic
• where the outputs are determined solely by the current states of the inputs
• sequential logic
• where the outputs are determined not only by the current inputs but also by the sequence of
inputs that led to the current state
• A common example of a circuit employing sequential logic is the flip-flop, also called a bistable
gate.
• A simple flip-flop has two stable states.
• The flip-flop maintains its states indefinitely until an input pulse called a trigger is received.
• If a trigger is received, the flip-flop outputs change their states according to defined rules, and
remain in those states until another trigger is received.
• Implementing a function from a Boolean expression
Example – Implement the function
X  A  BC
• Implementing a function from a Boolean expression
Example
Implement the function Y  AB  CD
Assignment - 4
• Generate a Boolean expression from below logic
diagram
Example (continued)
– work progressively from the inputs to the output adding logic
expressions to the output of each gate in turn
• Implementing a logic function from a description
Example
The operation of the Exclusive OR gate can be stated as:
“The output should be true if either of its inputs are true,
but not if both inputs are true.”
This can be rephrased as:
“The output is true if A OR B is true,
AND if A AND B are NOT true.”

We can write this in Boolean notation as

X  (A  B)  (AB)
Example (continued)
The logic function
X  (A  B)  (AB)
can then be implemented as before
• Implementing a logic function from a truth table
Example
Implement the function of the following truth table
A B C X – first write down a Boolean
0 0 0 0 expression for the output
0 0 1 1
0 1 0 0
– then implement as before
0 1 1 0 – in this case
1 0 0 0
1 0 1 1
X  A BC  ABC  ABC
1 1 0 1
1 1 1 0
Example (continued)
The logic function X  A BC  A BC  AB C
can then be implemented as before
• In some cases it is possible to simplify logic expressions
using the rules of Boolean algebra
Example can be simplified to
X  ABC  A BC  AC  A C X  BC  A

hence the following circuits are equivalent


• Binary arithmetic
• much simpler than decimal arithmetic
• can be performed by simple circuits, e.g. half adder
• More complex circuits can add digital words
 Similar circuits can be
constructed to perform
subtraction
 More complex arithmetic
(such as multiplication and
division) can be done by
dedicated hardware but is
more often performed using a
microcomputer or complex
logic device
Numeric and Alphabetic Codes

• Error detecting and correcting codes


• adding redundant information into codes allows the detection of transmission errors
• examples include the use of parity bits and checksums
• adding additional redundancy allows errors to be not only detected but also corrected
• such techniques are used in CDs, mobile phones and computer disks
Key Points
• It is common to represent the two states of a binary variable by
‘0’ and ‘1’
• Logic circuits are usually implemented using logic gates
• Circuits in which the output is determined solely by the current
inputs are termed combinational logic circuits
• Logic functions can be described by truth tables or using Boolean
algebraic notation
• Binary digits may be combined to form digital words
• Digital words can be processed using binary arithmetic
• Several codes can be used to represent different forms of
information
END
Questions
• Draw the logic circuit for the logic function: X  (A  B)  (AB)

You might also like