I have a question regarding the worked out example that the book explains on page 35 in chapter 2. In order to determine the inputs for the function x-1, they are using the boolean values of 1 and 0, 1 being true and 0 false. So when the bit is 0, the x input is not zeroed or negated, and the no bit is not negated, and when 1, y is zeroed then negated bitwise, and the arithemitic is addition. I'm I correct?
You've got the right idea. Isn't it interesting how by combining a handful of operations on x and y we can exhibit different higher-order operations? Search the forum for the "ALU Worksheet" if you need help convincing yourself about how this works.
I'm having difficulty understanding how the ALU chip (specifically CMP file) is
working. In ch 2 pg 39 the implementation instructions says that "my first step is to create a logical circuit that manipulates a 16 bit input according to the nx and zx control bit".Does this mean I have to create a condition statement for finding zx and nx,as well as zy,ny,f,
and no, using binary digits?
If this is true then going back to the cmp file in the ALU chip, I'm assuming that when it's running its starting from the two 16-bit inputs, x and y,x first to determine
the conditions for zx and nx then y to determine the conditions for
zy and ny. From here the chip is using logic to determine to create condition statements for the last two control bits right?
Nevermind, I didn't look at the tst file, now I understand how it works.