Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Aug 1, 2011
This was a collab by Treesin and myself, following the second chapter of The Elements of Computing Systems. The instructions are 6 bit; io: Invert output ix: Invert x iy: Invert y 1x: Make x 1111 1111 1y: Make y 1111 1111 s: If 1, use the adder. If 0, use AND.
This was based on demorgan for logic gates. Bitshifting and XOR was decoded seperately. The possible outputs were; 0, 1, -1, x, y, !x, !y, -x, -y, x+y, x-y, y-x, x OR y, x AND y, x NOR y, x NAND y, x IMPLIES y, y IMPLIES x, x XOR y, x XNOR y, bitshift x left, bitshift x right, bitshift x left looping, bitshift x right looping, bitshift y left, bitshift y right, bitshift y left looping, bitshift y right looping. Everything but subtracting worked in 20 ticks sync. I found out that a normal Kogge-Stone Carry-Lookahead Adder can't subtract, so I needed to find a way to make it (I made a 2 tick full adder for that). It's also been proven in-game that my adder can be optimised further, into a circuit that's far more optimal than used in modern-day processors.