Lecture11 - 1 1 1 1 1 3/5 Lecture 11 Atousa...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
ENSC15 0 Lecture 11 Agenda Implementing functions using Multiplexers 1/5 Lecture 11 Atousa Hajshirmohammadi, SFU
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Value Fixing Recall; Implementing a function using a decoder and value fixing: The above circuit is simply a MUX with the values of the “input lines” fixed. 2/5 Lecture 11 Atousa Hajshirmohammadi, SFU
Background image of page 2
Example Let’s implement a “Full Adder”. A full adder has three inputs, one input being the “Carry in” and two inputs being the bits to be added. It has two outputs, the “sum” bit and the “carry out” bit. The T.T. is as below: C in X Y C out S 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4