Beruflich Dokumente
Kultur Dokumente
at any time are determined directly from the present combinations of inputs without regards of previous inputs.
y For n input variable, there are 2n combinations. y For each possible input combination there is one and only
Procedures
y Two important procedure for combinational circuit y Design:
y Given the specifications, build it
y Analysis:
y Given circuit schematic, explain its behavior
Design Procedure
y Problem is specified y From Specifications, determine the required number of y y y y
inputs and outputs Assign a variable to each input and output Derive a truth table that defines the required relationship between inputs and outputs Perform logic minimization Draw the logic diagram
ADDERS
y Adder performs the addition function of the given inputs
y y y y
two bits. y Full adder is the combinational circuit of three bits (two significant bits and a previous carry). y Two half adders can be employed to implement a full adder
needs two binary inputs and two binary outputs. y We arbitrarily assign symbols x and y to the two inputs and S to the sum and C for the carry. y We can develop its truth table
y They are simplified too. y We can draw logic diagram for this implementation.
are three input variables and two output variables y We give names to input variable as x, y and z y The x and y denotes the significant bits to be added and z denotes carry from the previous lower significant position. y We also give name to outputs as S (least significant bit of sum) and C(carry)
y Truth table
X+y+z
(X,Y,Z)
y Simplifying
SUBTRACTORS
y Subtraction of two binary numbers may be accomplished by taking y y y y
the complement of the subtrahend and adding it to the minuend. Half Subtractor Full Subtractor In case of x-y, two situations When x>=y
y 0-0=0 y 1-0=1 y 1-1=0
y When x<y
y 0-1 , it is necessary to borrow 1 from higher stage
bits and produces their differences It also has an output to specify if a 1 has been borrowed. Designate minuend bit as x and the subtrahend bit by y Designate the difference output as D Designate the other output as B (borrow), generates the binary signal that informs the next stage that 1 has been borrowed
y Truth table
y B is 0 for x>=y y B is 1 for x=0 and y=1 y Expressing Boolean functions as B and D
S in half adder
y Truth table
Analysis Procedure
y Analysis process is reverse of the design process y This starts with the logical diagram and culminates with a set
of Boolean functions, a truth table or verbal explanation of circuit operation. y For the analysis of combinational circuit, make sure that it does not contain any feedback path or memory elements.
y A feedback path is a connection from the output of one gate to
the input of a second gate that forms part of the input to the first gate.
Example
The circuit consists of three variables A,B ,C and two binary outputs F1 and F2 The output of gates that are function of input variables T1, T2 and F2
defined symbols
the procedure is :
NAND Gate is also known as Universal Gate, because any digital system can be implemented with it.
Example
y Obtain NAND gate implementation of the
F=A(B+CD)+BC
C D B A B C F
AND A AND B C
OR
B C
Example
y Develop NAND implementation of (A+B)(CD+E)
Analysis Procedure
y Develop Boolean function of the given circuit
C D T1
T3 B T4 A F B C T2
T3 B T4 A F T2 B C
Block Transformation
y How can you convert a NAND logic diagram to its
equivalent AND-OR logic diagram y Substitute the NAND gate with invert OR gate y Cancel the circles that appear on one line
Example
y Obtain NOR gate implementation of the
F=A(B+CD)+BC
C D B A B C F
Analysis Procedure