Labels

Android (1) bash (2) boost (2) C (34) C++ (2) cheatsheet (2) CLion (6) css (3) Debian (33) DL (17) Docker (1) Dreamweaver (2) Eclipse (3) fail2ban (4) git (5) GitHub (4) Hacking (3) html (8) http (1) iOS (1) iPad (1) IRC (1) Java (30) javascript (3) Linux (164) Mac (19) Machine Learning (1) mySQL (47) Netbeans (4) Networking (1) Nexus (1) OpenVMS (6) Oracle (1) Pandas (3) php (16) Postgresql (8) Python (9) raid (1) RedHat (14) Samba (2) Slackware (45) SQL (14) svn (1) tar (1) ThinkPad (1) Virtualbox (3) Visual Basic (1) Visual Studio (1) Windows (2)

Thursday 30 April 2020

Half adder and 1 bit full bit adder

Half Adder


A Half Adder can be see in Fig.1 and Fig.2 below;

Fig.1

Fig.2

This is when we are adding only a single bit, for example, see Fig.3;

Fig.3


Full Adder


A Full Adder can be seen in Fig.4, Fig.5 & Fig.6 below;

Fig.4

Fig.5

Fig.6

If we were to add 1110 and 0111 then referring to Fig.6 above, A0 would be the right most bit of the first number (0) and B0 would be thee right most bit of the second number (1) and so on, moving from right to left, so;

0100 = A3=1, A2=1, A1=1 and A0=0
0111 = B3=0, B2=1, B1=1 and B0=1

S is the result of the individual calculation, so;

S0 = 1
S1 = 0
S2 = 1
S3 = 0

The C is the carry bit naturally, so C2, C3 and C4 = 1

the calculation can be seen below in Fig.7

Fig.7



Figures, reproduced from printed material for personal use.


No comments:

Post a Comment

Note: only a member of this blog may post a comment.