digital logic problems

30
Digital Logic Problems (II) Prof. Sin-Min Lee Department of Mathematics and Computer Science

Upload: keithkr

Post on 02-Jun-2018

231 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 1/30

Digital Logic Problems (II)

Prof. Sin-Min Lee

Department of Mathematics andComputer Science

Page 2: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 2/30

Page 3: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 3/30

Page 4: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 4/30

Page 5: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 5/30

Page 6: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 6/30

Page 7: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 7/30

Page 8: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 8/30

Page 9: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 9/30

Page 10: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 10/30

Multiplexers

• A combinational circuit that selects info

from one of many input lines and directs it

to the output line.

• The selection of the input line is controlled

 by input variables called selection inputs.

• They are commonly abbreviated as “MUX”. 

Page 11: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 11/30

Implementing Boolean

functions with multiplexers 

• Any Boolean function of n  variables can beimplemented with 2n -1-to-1 multiplexer. The

 procedure for implementing a Boolean functionwith a multiplexer is

• 1.Express the function in its sum of mintermsform.

• 2. Order the sequence of variables chosen for theminterms. Suppose the sequence is , where A  isthe leftmost variable, and are the remaining n -1variables.

Page 12: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 12/30

• 3.Connect the n -1 variables to the selection lines

of the 2n -1-to-1 multiplexer, with B  connected to

the highest order selection line, and so on.• 4. Construct the implementation table: List all the

minterms in two rows.

• The first row consists of minterms 0 to 2n -1 -1 (in all of

which A  is complemented).

• The second row consists of minterms 2n -1 to 2n -1 (in all

of which A  is uncomplemented). .

Page 13: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 13/30

• 5. Circle all the minterms of the function andinspect each column in the implementation tableseparately

• If the two minterms in a column are not circled, apply 0to the corresponding multiplexer input.

• If the two minterms are circled, apply 1 to thecorresponding multiplexer input.

• If the bottom minterm is circled, and the top is notcircled, apply A  to the corresponding multiplexer input.

• If the top minterm is circled but not the bottom, applyA*

Page 14: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 14/30

Page 15: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 15/30

• Multiplexers and decoders are used when many

lines of information are being gated and passed

from one part of a circuit to another.• Multiplexing is when multiple data signals share a

common propagation path. Time multiplexing is

when different signals travel along the same wire

 but at different times. These devices have data andaddress lines, and usually include an enable/

disable input. When the device is disabled the

output is locked into some particular state and is

not effected by the inputs.

Page 16: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 16/30

Page 17: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 17/30

Page 18: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 18/30

Consider the function of 3 variables:

1. Input variables B  and C  are applied to the selection lines s 1 and s 0,

respectively.

2. Construct the implementation table, and circle all the minterms of thfunction in the implementation table

3. Apply 0, 1, A , and

A*  to the inputs I 0 

through I 3.

Page 19: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 19/30

Multiplexers (continued)• S0 and S1 are the selection inputs.

• D0, D1, D2, D3 are the input lines.

Page 20: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 20/30

Multiplexers (continued)• MUX blocks can be combined in parallel with common

selection and enable inputs to perform selection on multiple

 bit quantities.

Page 21: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 21/30

Combinational circuit

implementation using MUX• We can use Multiplexers to express

Boolean functions also.

• Expressing Boolean functions as MUXs

is more efficient than as decoders.

• First n-1 variables of the function used

as selection inputs; last variable used as

data inputs.• If last variable is called Z, then each

data input has to be Z, Z’, 0, or 1. 

Page 22: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 22/30

Page 23: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 23/30

Page 24: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 24/30

Page 25: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 25/30

Page 26: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 26/30

Karnaugh Map Method of Multiplexer Implementation

Consider the function:

A is taken to be the data variable and B,C to be the select variables.

Page 27: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 27/30

Example of MUX combo circuit• F(X,Y,Z) = Sm(1,2,6,7)

Page 28: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 28/30

Page 29: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 29/30

Implement g(w,x,y)=wx+xy+wy using a 4-1 multiplexer.

Page 30: Digital logic problems

8/10/2019 Digital logic problems

http://slidepdf.com/reader/full/digital-logic-problems 30/30