# CS代考 COMP 273 4 – combinational logic 2 Jan. 20, 2016 – cscodehelp代写

COMP 273 4 – combinational logic 2 Jan. 20, 2016
Read-only memory (ROM) using combinational logic circuits
The truth tables are defined by “input variables” and “output variables”, and we have been thinking of them as evaluating logical expressions. Another way to think of a combinational circuit is as a Read Only Memory (ROM). The inputs encode a memory address. The outputs encode the value stored at the address. We say such a memory is read-only because the gates of the circuit are fixed.
For example, suppose the memory address is specified by the two input variables A1,A0, and the contents at each address are specified by the bits Y2Y1Y0. Here is a truth table:
A1 A0 Y2 Y1 Y0 00011 01001 10000 11100
and here is the corresponding memory. (Note that the address is not stored in the memory!)
output (contents of memory) 011
What is new about this concept? You now have to think of the input and output variables in a different way than you did before. Before, you thought of the input variables as having TRUE or FALSE values, and you did not associate any particular significance to their order. Thinking about the circuit as a ROM is quite different. You no longer think of each of the input variables as TRUE or FALSE. Rather, you think of the input variables as defining a binary number, namely an address. The order of the input variables now has a significance, since it defines an ordering on the address space. Similarly, the output variables are a string of bits whose order may or may not matter.
Arithmetic Circuits
Last class we discussed gates and circuits and how they could be used to compute the values of logical expressions, formed by NOT, AND, OR and other operators. Such circuits are called combinational logic circuits or combinational digital circuits. We will look at several more useful examples today.
How would we implement addition using these gates? Recall the algorithm from Lecture 1 for adding two n-bit numbers, A and B :
Cn−1 Cn−2 … C2 C1 C0
An−1 An−2 … A2 A1 A0 + Bn−1 Bn−2 … B2 B1 B0 ———————————
last updated: 11th Mar, 2016
1 lecture notes ⃝c

COMP 273 4 – combinational logic 2 Jan. 20, 2016
Sn−1 Sn−2 … S2 S1 S0
The Ci are the carry bits, and Si are the sum bits. Note that C0 = 0 because there is no way to carry in. (It will be clear later why we are defining this bit.)
How are we interpreting these bits? We are doing ”odometer arithmetic” here, so it doesn’t matter whether we are thinking of the numbers as signed (twos complement) or unsigned. This does matter when we interpret the results, but it doesn’t matter from the standpoint of the mechanisms for computing the sum.
The rightmost bit (or least significant bit) S0 of the sum is simple to determine using logical expressions and combinational circuits, as is the carry out bit C1.
A0 B0 S0 C1 0000 0110 1010 1101
S0 = A0 ⊕ B0
C1 = A0 · B0
The circuit that implements these is called a half adder. It has two inputs and two outputs. You should be able to draw this circuit yourself. More generally, the values of the kth sum and carry out bits are given as follows:
Ck Ak Bk Sk Ck+1 00000 00110 01010 01101 10010 10101 11001 11111
which we can represent using sum-of-products circuits as defined by these expressions: Sk =Ak ·Bk ·Ck +Ak ·Bk ·Ck +Ak ·Bk ·Ck +Ak ·Bk ·Ck
Ck+1 =Ak ·Bk ·Ck +Ak ·Bk ·Ck +Ak ·Bk ·Ck +Ak ·Bk ·Ck
The box with the ’+’ below contains the combinational circuitry for implementing the truth table above. Note that we have used a full adder for the least significant bit (LSB) and set C0 to 0.
This circuit is called a ripple adder. To compute Sn−1 you need to allow the carries to ripple through from bits 0 up to bit n − 1. This suggests that for large n (say 32 bits for A and B each), you would have to allow a long delay. Later this lecture, we will discuss how this delay can be avoided. For now, we turn to other useful combinational circuits.
last updated: 11th Mar, 2016 2 lecture notes ⃝c

4 – combinational logic 2
Jan. 20, 2016
last updated: 11th Mar, 2016 3 lecture notes ⃝c
An encoder is a combinational logical circuit whose outputs specify which of a set of possible inputs or groups of inputs has occured. The term encoder is used somewhat loosely. (There is no generally agreed upon formal definition of an encoder that I am aware of.) Let’s look at a few examples.
A common example is a set of m input wires, such that exactly one of them has the value 1. For example, consider a keyboard with 5 buttons and suppose that the mechanics of these buttons are such that one and only one of these buttons is pressed down. (You may have seen something like this on a children’s toy.) Such an encoder might be constructed using the truth table:
A B C D E Y1 Y2 Y3 00001001 00010010 00100011 01000100 10000101
Notice that if none of the button is pressed, or if multiple buttons is pressed (because you push hard and break the mechanism), then the above truth table does not specify what the value of the output variables Yi is. But this is not a problem, as long as the design is such that only one can be pressed (1) at any time.

COMP 273 4 – combinational logic 2 Jan. 20, 2016
Suppose we allow for multiple buttons to be pressed and we want to explicitly indicate in the truth table what the output of the circuit will be for each possible input. One way to do it is shown below. Consider the following truth table and recall that X means “don’t care”. If no buttons are pressed, the output is 000. If two or more buttons are pressed, then the output is the same as if only the rightmost of these buttons was pressed.
A B C D E Y1 Y2 Y3 interpretation
0 0 0 0 0 0 0 0 noneofthebuttonsispressed
X X X X 1 0 0 1 Eispressed(andmaybeA,B,C,D)
X X X 1 0 0 1 0 DandnotE(butmaybeA,B,C)
X X 1 0 0 0 1 1 CandneitherEnorD(butmaybeA,B) X 1 0 0 0 1 0 0 etc
1 0 0 0 0 1 0 1 etc
For example, written as a sum-of-products, we would have
Y1 = (A·B·C·D·E)+(B·C·D·E) Y2 = (D·E)+(C·D·E)
Y3 = E+(C·D·E)+(A·B·C·D·E)
A second example of an encoder that you should be familiar with is an output device (an LCD) that displays a single digit from {0, 1, …, 8, 9}. Each digit is defined by “turning on” a subset of the line segments L1, · · · , L7. For example, when all seven of the line segments are on, the output digit represents “8”, whereas when all lines except L2 are turned on, the output digit represents “0”. In Exercises 2, you will write out the truth table for such an encoder.
ten buttons L5
A decoder is the opposite of an encoder. It takes a code (a binary number) as input, and turns on one of several output wires (or some other event, i.e. subset of the output wires). For example, here is a truth table for a 1-to-2 decoder:
A Y1 Y2 010 101
last updated: 11th Mar, 2016 4 lecture notes ⃝c

COMP 273 4 – combinational logic 2 Jan. 20, 2016 Here is the truth table for a “2-to-4 decoder”:
AB Y1Y2Y3Y4 001000 010100 100010 110001
You should be able to draw the circuit for these two examples.
Multiplexor (or selector)
One common way that decoders are used is to select from a set of possible input variables. The circuit that does a selection is called a multiplexor. A multiplexor takes n inputs and chooses among them. A multiplexor is also called a selector.
A multiplexor requires two types of inputs. The first carries the data that can go potentially through the circuit. The second carries a code saying which of the data goes through.
The simplest example of a multiplexor has two input wires that carry a bit of data – call these AandB–andaselectorinputwire–callitS–thatsayswhichofAandBtoselect. Itiscalleda 1-bit multiplexor. (We saw this example at the end of last lecture.) The three circuits shown below show this “one bit multiplexor” at three levels of increasing abstraction, from left to right.
Suppose instead we had four different inputs (A, B, C, D) and we wanted to select from them. Then we would use a “two bit multiplexor” circuit as shown below on the left. The MUX symbol on the right will be used whenever we want to hide the underlying circuitry.
Sometime the inputs A, B, C, D are not single bits, but may have many bits, e.g. we might be selecting one of four integers. In this case we might use the same notation show in the two bit multiplexor figure, and if we wanted to explicitly show that the inputs had a certain number (say 16) of bits, we would label the wires as such, by putting a little slash in each wire and writing 16. We will see examples later in the course and the notation will be come natural to you.
last updated: 11th Mar, 2016 5 lecture notes ⃝c

COMP 273 4 – combinational logic 2
Jan. 20, 2016
Let’s look at a few examples of how multiplexors can be useful. Recall the ripple adder discussed at the beginning of the lecture. We can reduce the long delays for the carries to propagate, using the following trick. Assume n is an even number. Divide the bits into low order bits (0, 1, . . . , n/2 − 1) and high order bits (n/2, . . . , n − 1). Build one circuit to compute the sum for the low bits. Build two circuits to compute the sum for the high order bits. Set the carry in bit for the LSB in the lower order bit circuit to 0. Set the carry in bits for the LSB in the two high order circuits to 0 and 1, respectively. In the figure below, the “+” box is a 16 bit adder, rather than a one bit adder. (I drew a slightly different looking figure in the lectures.)
The main idea here is that we don’t need to wait for the worse case in which the carries are passed through the entire circuit (e.g. adding A = 011111 · · · 111 and B = 0000 · · · 0001). Instead, once the carries pass through the first n/2 full adders and the circuits stabilize, we know which of the upper order sums we want. We just select it. Thus we have almost cut the computation time in half. I write “almost” because we also have to do the selection, which takes time.
Note that we could repeat this idea, and speed up the computation of the three n/2 bit additions, by decomposing each of them into three additions of n/4 bits, and so on. There is a tradeoff here between time (fast) and space (having the replicate the upper order bits to handle the two cases of the carry out from low order bits).
last updated: 11th Mar, 2016 6 lecture notes ⃝c

4 – combinational logic 2
Jan. 20, 2016
A15,A14,… A8 B15,B14,…,B8
S7,S6, …, S0
carry out bit
U S15,S14,…, S8 X
Subtraction
Suppose we wanted to build a circuit for performing subtraction.
An−1 An−2 … A2 A1 A0 – Bn−1Bn−2…B2B1B0
———————————-
To perform A − B, we compute A + (−B). This requires us to negate B and then send the result through the adder.
To negate a number that is represented in twos complement, we invert each of the bits and then add 1 (lecture 1). To do this with a combinational circuit is easy. We can use circuit similar to the adder except that the B bits need to be inverted B. To add one, we can set the carry in bit C0 to 1. See below on the left. Binvert is the variable that specifies whether we are doing addition (0) or subtraction (1). Note that we can use this variable both to select the B versus B, and for the C0.
last updated: 11th Mar, 2016 7 lecture notes ⃝c

4 – combinational logic 2
Jan. 20, 2016