Principles of Binary Addition in N - N Map - NUMA

Not logged in

Log In

Register

Maps

Hot Maps

Featured Maps

Random

Principles of Binary Addition in N

Thumbnail of the map 'Principles of Binary Addition in N'

Hover over the thumbnail for a full-size version.


Author	LLCoolDave
Tags	author:llcooldave test unrated
Created	2005-07-04
Last Modified	2005-07-04
Rating	3 more votes required for a rating.
Map Data	$Principles of Binary Addition in N#LLCoolDave#none#00010000000000000000000000100000000000000000000001000000000000000000000010000000000000000000000111111111110000000000001000000000111111100000010101111101000001000000101010000000101010000001010101010001000100000000000000101111101111111111111111000000000000000000000010110111111000000000000100001000010000000000001111110000100000000000000000000001000000000000000000000010000000000000000000000101111111111111111111111000000000000000000000000000111111111111111111110001000000000000000000000010000000000000000000000100000000000000000000001000000000000000000000010000000000000000000000100000000000000000000001000000000000000000000010000000000000000000000100000000000000000000001000000000000000000000000000000000000000000\|5^36,84!7^156,84,0!7^156,60,0!7^156,36,0!7^180,36,0!7^180,60,0!7^180,84,0!7^180,84,3!7^180,60,3!7^180,60,1!7^180,36,1!7^180,132,2!7^180,180,2!7^228,228,2!7^228,276,2!7^204,300,1!7^180,324,0!9^72,48,0,0,9,7,1,0,0!9^120,48,0,0,8,7,1,0,0!9^120,48,0,1,9,5,0,0,0!9^72,48,0,1,9,5,0,0,0!9^120,48,0,1,9,9,0,0,0!9^72,48,0,1,9,11,0,0,0!9^180,180,0,1,14,3,0,-1,0!9^180,180,0,1,14,4,0,-1,0!9^180,180,1,1,14,4,0,0,-1!9^180,180,1,1,14,3,0,0,-1!9^180,180,0,1,14,3,0,0,0!9^180,180,0,1,14,4,0,0,0!9^180,60,1,0,8,14,1,0,-1!9^180,36,1,0,9,14,1,0,-1!9^180,36,0,1,10,13,0,-1,0!9^180,60,0,1,10,13,0,-1,0!7^276,372,1!7^324,372,1!7^204,420,0!7^204,468,0!7^252,468,0!7^276,444,1!9^180,324,0,0,8,19,1,-1,0!9^180,324,1,0,11,14,1,0,-1!9^180,324,1,1,13,14,0,0,-1!9^180,324,0,1,8,17,0,-1,0!9^204,420,0,1,16,3,0,-1,0!9^204,420,0,1,16,4,0,-1,0!9^204,420,1,1,16,4,0,0,-1!9^204,420,1,1,16,4,0,0,0!9^204,420,1,1,16,3,0,0,-1!9^204,420,0,1,16,3,0,0,0!9^204,420,0,1,16,4,0,0,0!9^276,540,0,1,14,20,0,0,0!9^276,372,1,1,14,20,0,0,0!9^276,372,1,1,14,20,0,0,-1!9^276,372,0,1,14,20,0,-1,0!9^204,420,1,1,14,20,0,0,-1!9^204,420,1,1,14,20,0,0,0!9^204,420,0,1,14,20,0,-1,0!7^684,36,0!7^708,36,0!7^708,60,0!7^708,84,0!7^708,84,3!7^708,60,3!7^708,60,1!7^708,36,1!7^684,60,0!7^684,84,0!7^732,156,3!7^732,132,1!7^732,180,3!7^732,156,1!7^660,132,0!7^660,156,0!7^660,180,0!7^660,204,0!7^660,228,0!7^732,204,3!7^732,180,1!7^732,228,3!7^756,228,3!7^708,180,3!7^708,156,3!7^708,132,1!7^708,132,2!7^708,156,2!7^732,180,2!7^732,204,2!7^708,180,2!7^684,180,0!7^708,204,2!7^684,204,0!7^684,252,3!7^756,252,2!7^732,252,0!7^684,228,0!7^708,204,1!7^732,276,3!7^756,300,2!7^732,300,0!7^708,276,0!7^756,348,3!7^732,348,3!7^708,276,2!7^684,276,0!7^660,252,0!7^684,252,3!7^684,228,1!7^660,276,0!7^732,204,1!7^756,204,1!7^732,276,2!7^732,300,2!7^732,324,1!7^756,324,1!7^732,252,1!7^732,300,1!7^756,300,1!7^684,252,2!7^684,228,2!7^684,204,2!7^684,180,2!7^684,156,2!7^684,132,2!7^684,276,2!7^708,300,0!7^708,300,2!7^684,300,0!7^684,300,2!7^660,300,0!7^684,300,1!7^708,300,1!7^708,348,3!7^708,324,1!7^684,348,3!7^684,324,1!7^660,348,3!7^660,324,1!7^660,300,1!7^660,324,3!7^636,324,0!7^660,324,2!11^660,324,660,324!9^636,36,0,0,30,6,1,0,0!9^564,36,0,0,30,6,1,-1,0!9^636,36,0,1,30,5,0,0,0!9^564,36,0,1,30,5,0,0,0!9^636,36,0,1,30,7,0,0,0!9^564,36,0,1,30,8,0,0,0!9^708,156,0,1,22,6,0,-1,0!9^708,156,1,1,22,6,0,0,-1!9^708,156,0,1,22,6,0,0,0!9^708,156,1,1,22,6,0,0,0!9^708,156,0,1,22,7,0,-1,0!9^708,156,0,1,22,7,0,0,0!9^708,36,1,0,30,9,1,0,0!9^708,60,1,0,29,9,1,0,0!9^708,36,0,1,30,9,0,0,0!9^708,60,0,1,30,9,0,0,0!9^684,228,1,0,30,11,1,0,0!9^684,228,1,0,28,10,1,0,0!9^684,228,1,1,29,10,0,0,0!9^684,228,1,1,31,11,0,0,0!9^708,276,0,1,22,9,0,-1,0!9^708,276,1,1,22,9,0,0,-1!9^708,276,0,1,22,9,0,0,0!9^708,276,1,1,22,9,0,0,0!9^708,276,0,1,22,10,0,-1,0!9^708,276,1,1,22,10,0,0,0!9^708,276,0,1,22,10,0,0,0!9^708,276,1,1,29,15,0,0,-1!9^708,276,1,1,29,15,0,0,0!9^708,276,0,1,29,15,0,-1,0!9^732,300,1,1,29,15,0,0,0!9^732,300,1,1,29,15,0,0,-1!9^732,300,0,1,29,15,0,-1,0!9^660,324,0,1,29,15,0,0,0!7^708,156,1!9^72,48,0,0,9,9,1,-1,0!9^120,48,0,0,9,11,1,-1,0!9^564,36,0,0,30,7,1,-1,0!9^636,36,0,0,30,8,1,-1,0#
Description	DO NOT RATE. This is just to explain the way I thought of for realising it, might very well not be optimal. Idea/Concept: The first two switches are the bits of the number. The next two switches are possible carry overs from previous added bits. Two switches, because there are two positions where carry overs may happen in this concept. As they are ORed, you don't have to worry if you hit both of them. At first we AND/NAND/XOR the two initial bits, as seen in my XOR map. Top path is NAND, second path is AND, third and fourth path are xor. The AND path contains the carry over of type A. At the end of the NAND and AND pathes we set the paths for the upcoming switches. After that, we go down if we have a carryover (or two, but that's not possible in real circumstances) by ORing the two possible carryovers. After that, the path you follow is chosen by whether we have a 0 (AND or NAND) or a 1 (XOR) of the first binary operation, displaying the final results (or on the OR path possibly createing a carryover of type B). On the right side you see the same idea, just cramped into as little space as I saw possible, and it's small enough to start working on a 8 Bit Adder, which I will begin work on now. Again, please DO NOT VOTE. This is just some information for people who are interested in this. Edit: Made a small messup on the XOR part, has been fixed.

Other maps by this author


N Olympic Games: Walljumping 2	N Olympic Games: Walljumping 3	One-Way Maze	Precision	Jump Challenge 1	XORAND Gate

Comments

Pages: (0)

2005-07-04

wow

complicated stuff. allthough im pretty stumped by everything you just said :-s