slide1 l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
ECE2030 Introduction to Computer Engineering Lecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mu PowerPoint Presentation
Download Presentation
ECE2030 Introduction to Computer Engineering Lecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mu

Loading in 2 Seconds...

play fullscreen
1 / 36

ECE2030 Introduction to Computer Engineering Lecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mu - PowerPoint PPT Presentation


  • 136 Views
  • Uploaded on

ECE2030 Introduction to Computer Engineering Lecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mux/DeMux. Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Tech. N inputs. M outputs. Combinational circuits. Combinational Logic.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'ECE2030 Introduction to Computer Engineering Lecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mu' - guillermo


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide1

ECE2030 Introduction to Computer EngineeringLecture 10: Building Blocks for Combinational Logic (1) Timing Diagram, Mux/DeMux

Prof. Hsien-Hsin Sean Lee

School of Electrical and Computer Engineering

Georgia Tech

combinational logic

N

inputs

M

outputs

Combinational

circuits

Combinational Logic
  • Outputs, “at any time”, are determined by the input combination
  • When input changed, output changed immediately
    • Real circuits is imperfect and have “propagation delay”
  • A combinational circuit
    • Performs logic operations that can be specified by a set of Boolean expressions
    • Can be built hierarchically
timing diagram
Timing Diagram
  • Describe the functionality of a logic circuit across time
  • Represented by a waveform
  • For combinational logic, Output is a function of inputs
timing diagram of an and gate output ab

A

B

Timing Diagram of an AND Gate (Output=AB)

Time

t0

t1

t2

t3

t4

t5

t6

t7

t8

t9

t10

t11

t12

Output

(No Delay)

Note that the Output change can occur “at any Time” for

Combinational logic

timing diagram example

t0

t1

t2

t3

t4

t5

t6

t7

t8

t9

t10

Timing Diagram Example

Y

A

F

X

B

Z

A

B

X

Y

Z

F

timing diagram example6

t0

t1

t2

t3

t4

t5

t6

t7

t8

t9

t10

F = A B

F

Timing Diagram Example

Y

A

F

X

B

Z

A

B

combinational logic7

N

inputs

M

outputs

Combinational

circuits

Combinational Logic
  • Outputs, “at any time”, are determined by the input combination
  • We will discuss
    • Multiplexers / De-Multiplexers
    • Decoders / Encoders
    • Comparators
    • Parity Checkers / Generators
    • Binary Adders / Subtractors
    • Integer Multipliers
multiplexers mux

En

A0

A1

F

4-to-1

Mux

A2

A3

S1

S0

Multiplexers (Mux)
  • Functionality: Selection of a particular input
  • Route 1 of N inputs (A) to the output F
  • Require selection bits (S)
  • En(able) bit can disable the route and set F to 0
multiplexers mux w out enable
Multiplexers (Mux) w/out Enable

A0

A1

F

4-to-1

Mux

A2

A3

S1

S0

multiplexers mux w out enable10
Multiplexers (Mux) w/out Enable

A0

A1

F

4-to-1

Mux

A2

A3

S1

S0

multiplexers mux w enable

En

A0

A1

F

4-to-1

Mux

A2

A3

S1

S0

Multiplexers (Mux) w/ Enable
4 to 1 mux w enable logic14

En

4-to-1 Mux w/ Enable Logic

S1

S0

F

A0

A1

Reduce one Gate Delay

by using 4-input

AND gate for the 2nd

level

A2

A3

En

4 to 1 mux using transmission gates17
4-to-1 Mux using Transmission Gates

S1=0

S0=0

A0

A0

A0

A1

F

A2

A2

A2

A3

4 to 1 mux using transmission gates19
4-to-1 Mux using Transmission Gates

S1=1

S0=1

A0

A0

A1

A1

F

A2

A2

A3

A3

4 to 1 mux using transmission gates with enable f z when en 0

En=1 X=S0 Y=S0

X=En· S0

Y=En + En·S0 = En + S0

4-to-1 Mux using Transmission Gates with Enable (F=Z when En=0)

A0

X

Y

A1

En=0 X=0 Y=1 (To disable both TG)

simplified 4 to 1 mux using tgs with enable f z when en 0

X=En· S0

Y=En + En·S0 = En + S0

Simplified 4-to-1 Mux using TGs with Enable (F=Z when En=0)

En

S1

S0

A0

A0

X

F

Y

A1

A2

A2

Only Disable the 2nd level

A3

quadruple 2 to 1 line mux
Quadruple 2-to-1 Line Mux

En

A[3:0]

A3..0

2-to-1

Mux

(4-bit bus)

F[3:0]

B3..0

B[3:0]

SEL

quadruple 2 to 1 line mux27

A3

A2

A1

F3

F2

F1

B3

B2

B1

Quadruple 2-to-1 Line Mux

A0

F0

Fx=Ax·En·SEL+Bx·En·SEL

SEL

B0

En

design canonical form w mux

A0

A1

A2

8-to-1

Mux

F

A3

A4

A5

A6

A7

S2

S1

S0

B

C

A

Design Canonical Form w/ MUX

Each input in a MUX is a minterm

0

1

1

0

0

0

1

1

design canonical form w mux30

C

Vdd

Design Canonical Form w/ MUX

En

C

A0

A1

F

4-to-1

Mux

0

A2

1

A3

S1

S0

B

A

design canonical form w mux32

A

Vdd

Design Canonical Form w/ MUX

En

A0

A1

F

4-to-1

Mux

A2

A

A3

S1

S0

C

B

demultiplexers demux

A0

A1

F

4-to-1

Mux

A2

A3

S1

S0

Demultiplexers (DeMux)

D0

D1

1-to-4

DeMux

A

D2

D3

S1

S0

demux operations
DeMux Operations

D0

D1

1-to-4

DeMux

A

D2

D3

S1

S0