Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Mechanical binary adder by syn2cat hackerspace

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
426 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Oct 20, 2011

First calculation on the binary adder machine. Here we calculate 7+10=17 or 0111+1010=10001
You see 7 half adders, the 3 left towers are each time 2 half adders stacked and on the right side is one additional half adder (which is adding the lowest bits)

So the machine can add 2 numbers of 4 bits each.
On each tower you put the the right value bits of botrh operands. So on colum 2 you put on every input one marble because both operands have a 1 on the second bit position (from the right).

DUring calculation the first adder drops out a marble, that is the lower order bit, value 1.
No other adder drops any marbles.
You can see the carry bits going through the looping to the next adder.
At the end the last adder drops a marble on the floor, that's the carry out. It has a value of 2⁴=16
Result: 1+16=17

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (0)

Sign In or Sign Up now to post a comment!
Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more