Chap 2. Combinational Logic Circuits. 2.1 Binary Logic and Gates Logic Gates –electronic circuits...

Chap 2. Combinational Logic CircuitsChap 2. Combinational Logic Circuits

2.1 Binary Logic and Gates2.1 Binary Logic and Gates

Logic Gates– electronic circuits that operate on one or

more input signals to produce an output signal

2.1 Binary Logic and Gates2.1 Binary Logic and Gates

2.2 Boolean Algebra2.2 Boolean Algebra

deal with binary variables and logic operations– with three basic

logic operations AND, OR, NOT

– Implemented with logic circuits

F = X + Y' Z


Basic Identities of Boolean Algebra–most basic identities of Boolean algebra


Algebraic Manipulation– Boolean algebra is a

useful tool for simplifying digital circuits

– F = X'YZ + X'YZ' + XZ = X'Y (Z+Z') + XZ

= X'Y 1 + XZ = X'Y + XZ


popular tools 1. X + XY = X (1 + Y) = X

2. XY + XY' = X (Y + Y') = X

3. X + X'Y = (X + X') (X + Y) = X + Y

4. X (X + Y) = X + X Y = X (1 + Y) = X

5. (X + Y)(X + Y') = X + YY' = X

6. X (X' + Y) = XX' + XY = XY

7. (consensus theorem)

XY + X'Z + YZ = XY + X'Z

dual (X+Y)(X'+Z)(Y+Z) = (X+Y)(X'+Z)


Complement of a Function– F = X'YZ' + X'Y'Z– F' = (X'YZ' + X'Y'Z)'

= (X'YZ')' (X'Y'Z)'

= (X + Y' + Z) (X + Y + Z')

2.3 Standard Forms2.3 Standard Forms

Sum of product– Product terms (minterms) 의 sum

Products of sum– Sum terms (maxterms) 의 products

Minterms & Maxterms– Product (Sum) terms in which all the variables

appear exactly once, either un-complemented or complemented

– Ex) 4 minterms for 2 variables X & Y X'Y', X'Y, XY', & XY

2.3 Standard Forms2.3 Standard Forms

mj’=Mj

2. 3 Standard Forms2. 3 Standard Forms

- sum of products

E(X,Y,Z) = m(0,1,2,4,5)

- product of sums

E(X,Y,Z)' = m(3,6,7)

X Y Z F

0 0 0 1

0 0 1 1

0 1 0 1

0 1 1 0

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 0

2.4 Map Simplification 2.4 Map Simplification – 3 variables– 3 variables


F1(X,Y,Z) = m(3,4,6,7) F2(X,Y,Z) = m(0,2,4,5,6)

(Ex) F2(X,Y,Z) = m(1,3,4,5,6)


F(W,X,Y,Z)

= m(0,1,2,4,5,6,8,9,12,13,14)

= Y' + W'Z' + XZ'

F = A'B'C' + B'CD' + A'BCD' + AB'C'

= B'D' + B'C' + A'CD'


From sum-of-products to product-of-sums– complement the function

F(A,B,C,D) = m(0,1,2,5,8,9,10)

F' = AB + CD + BD‘

F = (A'+B')(C'+D')(B'+D)

2.4 Map Simplification 2.4 Map Simplification – don’t care– don’t care

Ex) F(A,B,C,D) = m(1,3,7,11,15) d(A,B,C,D) = m(0,2,5)

F = CD + A'B' = CD + A'D

2.6 NAND and NOR Gates2.6 NAND and NOR Gates

NAND gate– a universal gate

• because any digital system can be implemented with it


Two-Level Implementation– easy to implement with NAND gates, if the function is in

sum of products form

(Ex) F = AB + CD

F = ( (AB)‘)’+ ((CD)‘)’ = ( (AB)' (CD)' )' = AB + CD


F(X,Y,Z) = m(1,2,3,4,5,7)


NOR gate– dual of the NAND operation– another universal gate– implementation of NOT

(inverter), AND, OR

Chap 3. Combinational Logic DesignChap 3. Combinational Logic Design

3.1 Combinational Circuits3.1 Combinational Circuits

logic circuits for digital systems: combinational vs sequential

Combinational Circuit (Chap 3)– outputs are determined by the present applied inputs– performs an operation, which can be specified logically

by a set of Boolean expressions

Sequential Circuit (Chap 4)– logic gates + storage elements (called flip-flops)– outputs are a function of the inputs &

bit values in the storage elements (state of storage elements is a functi

on of previous inputs)– output depends on the present values of inputs & past inputs

3.4 Design Procedure

Procedure to design combinational circuits 1) Determine required number of inputs

& outputs & assign a letter symbol to each 2) Derive the truth table 3) Obtain simplified Boolean functions for each output 4) Draw the logic diagram 5) Verify the correctness of the design

Truth Table– n input variables: 2n binary numbers– output functions give the exact definition of comb circuit

simplified by method, such as algebraic manipulation, map method, computer programs

3.4 Design Procedure – code converter

BCD to Excess-3 Code Converter


– Two-level AND-OR logic diagram

W = A + BC + BD = A + B(C + D)

X = B'C + B'D + BC'D' = B'(C + D) + BC'D‘

Y = CD + C'D‘ = (C D)‘

Z = D'


Ex) BCD to Seven-Segment Decoder

– outputs (a, b, c, d, e, f, g)– 7 four-variable maps

3.5 Decoders

Decoders

– n 비트 이진정보 => 2n ( 이하 ) 의 출력

N-to-m-line decoders (m < 2n)– generate 2n (or fewer)

minterms of n input variables

– Ex) 3-to-8-line decoder (3 inputs & 8 outputs)

3.5 Decoders

Ex) binary-to-octal conversion

3.5 Decoders - Expansion

3-to-8-line decoder with two 2-to-4-line decoders

if A2=0, upper is enabled;

if A2=1, lower is enabled.

3.5 Decoders

Combinational Circuit Implementation– Ex) a binary adder

S(X,Y,Z) = m(1,2,4,7)

C(X,Y,Z) = m(3,5,6,7)

3.6 Encoders

perform the inverse operation of a decoder– 2n (or less) input lines and n output lines– Ex) Octal-to-binary encoder

A0 = D1 + D3 + D5 + D7

A1 = D2 + D3 + D6 + D7

A2 = D4 + D5 + D6 + D7

3.7 Multiplexers

n 개의 선택입력에 따라 2n 개의 출력 중에 하나를 선택하여 출력– 입력단자 : 2n input lines and n selection variables

Ex) 22-to-1-line multiplexer

– Also, called data selector or MUX

3.7 Multiplexers

Quadruple 2-to-1-Line Multiplexer

3.7 Multiplexers

Combinational Circuit Implementation– Any Boolean function of n variables can be

implemented with a multiplexer with (n-1) selection inputs and (2n-1) data inputs

– Ex) F(A,B,C,D) = m(1,3,4,11,12,13,14,15)• Implemented with 23-to-1 MUX

3.7 Multiplexers

Ex) F(A,B,C,D) = m(1,3,4,11,12,13,14,15)

3.7 Multiplexers

Demultiplexer (DEMUX)– perform the inverse operation of a multiplexer– receives information from a single line and transmits it to

one of 2n possible output lines– Ex) 1-to-4-line demultiplexer

• the input E has a path to all 4 outputs, • selected by two selection lines S1 and S0

“identical to a 2-to-4 line decoder with

enable input”

selectors

Chap 2. Combinational Logic Circuits. 2.1 Binary Logic and Gates Logic Gates –electronic circuits...

Documents

Transcript of Chap 2. Combinational Logic Circuits. 2.1 Binary Logic and Gates Logic Gates –electronic circuits...