CS3510Lecture15ppt：cs3510lecture15.pptVIP

* * * * * * * Lecture Dr. Clincy Lecture Slide * CS 3510 - Chapter 3 (3A and 10.2.2) – Part 4 of 5 Dr. Clincy Professor of CS Combinational logic circuits give us many useful devices. One of the simplest is the half adder, which finds the sum of two bits. We can gain some insight as to the construction of a half adder by looking at its truth table, shown at the right. Half Adder - Combinational Circuits Dr. Clincy * Lecture We can change our half adder into to a full adder by including gates for processing the carry bit. The truth table for a full adder is shown at the right. Full Adder - Combinational Circuits Dr. Clincy * Lecture Just as we combined half adders to make a full adder, full adders can be connected in series. The carry bit “ripples” from one adder to the next; hence, this configuration is called a ripple-carry adder. Today’s systems employ more efficient adders. Adders - Combinational Circuits Dr. Clincy * Lecture Among other things, they are useful in selecting a memory location according to a binary value placed on the address lines of a memory bus. This is what a 2-to-4 decoder looks like on the inside. If x = 0 and y = 1, which output line is enabled? Decoder - Combinational Circuits Dr. Clincy * Lecture Input - Encoded message Output - Decoded message Dr. Clincy Lecture * Decoder – another example A multiplexer does just the opposite of a decoder. It selects a single output from several inputs. This is what a 4-to-1 multiplexer looks like on the inside. If S0 = 1 and S1 = 0, which input is transferred to the output? Multiplexer - Combinational Circuits Dr. Clincy * Lecture Depending the “select input” combination, 1 of 4 data inputs is chosen for output Dr. Clincy Lecture * Multiplexer - Combinational Circuits Can also use multiplexers to implement logic functions Given this truth table, group X1,X2 being 00, 01, 10 and 11 – notice what happens with X3 3-input truth table can be done with a 4-input mux 4-input truth t