please dont rip this site

Digital Logic Tutorial


Binary Addition

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:

Next

Big Binary Adder


file: /techref/logic/add1.htm, 1KB, , updated: 2007/11/20 15:16, local time: 2008/11/22 11:33,
TOP NEW HELP FIND: 
38.103.63.55:LOG IN
©2008 PLEASE DON'T RIP! DO: LINK / DIGG! / MAKE!

 ©2008 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!
<A HREF="http://www.sxlist.com/techref/logic/add1.htm"> Digital Logic Tutorial: Binary Addition Circuit</A>

After you find an appropriate page, you are invited to your to this massmind site! (posts will be reviewed) Just type in the box and press the Post button. (HTML welcomed!): A tutorial is available Members can login to post directly, become page editors, and be credited for their posts.


Link? Put it here: 
if you want a response, please enter your email address: 
Did you find what you needed?

 

Welcome to sxlist.com!


Site supported by
sales, advertizing,
& kind contributors
just like you!

Please don't rip/copy
(here's why

Copies of the site on CD
are available at minimal cost.
  'What can I do?' - SiCKO

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  .