# Digital LogicTutorial

If you can't see the simulation below, try the Half Adder on Falstad.com

Believe it or not, 4 NAND gates can add a pair of binary numbers and find the sum. The only trick is that the binary numbers must be very small... Only one digit each. This adder can add 0+0=0, 0+1=1, 1+0=1, and 1+1=2. If you try to add even 0+2, it will fail to give the right output. But as with many things in digital logic, we can set many of these little adders side by side and make one that can do just about any size number. That is next. For now, look at how this works:

Isn't that cool!

You might notice that the sum (the right most column of the output, or lowest order bit) is just the XOR of the two inputs. It is 0 when the inputs are the same, and 1 when they are different. You can see the XOR circuit... just exclude the bottom right "carry" NAND gate.

The carry (left column, higher order bit) is just the AND (or NOT NAND) of the two inputs. It is only 1 when input A AND input B are 1. We make this by using the NAND gate at the input, and then adding a NAND configured as an inverter, picking off the output of that first NAND.

## Next

 file: /Techref/logic/add1.htm, 2KB, , updated: 2017/9/16 21:44, local time: 2022/6/27 10:53, TOP NEW HELP FIND:  18.232.177.219:LOG IN

 ©2022 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions?Please DO link to this page! Digg it! / MAKE! Digital Logic Tutorial: Binary Addition Circuit

After you find an appropriate page, you are invited to your to this massmind site! (posts will be visible only to you before review) Just type a nice message (short messages are blocked as spam) in the box and press the Post button. (HTML welcomed, but not the <A tag: Instead, use the link box to link to another page. A tutorial is available Members can login to post directly, become page editors, and be credited for their posts.

Attn spammers: All posts are reviewed before being made visible to anyone other than the poster.
 Did you find what you needed? "No. I'm looking for: " "No. Take me to the search page." "No. Take me to the top so I can drill down by catagory" "No. I'm willing to pay for help, please refer me to a qualified consultant"

.