Nummer Syetemes A B C D E F.9 8 $+ +h b+ bouee 1010 1011 1100 1101 1110 1111. 1001 1000 Jol 0J0 111 100 110 111 101 111. 100110 000 + eeeetc bugs 5 274 6 757.4 60 (ABCDEE98), = (52746757 . 460), | (43) pinany antumeric ‘The digital computers can do arithmetic operation only by means of binary. So it is must to describe the binary arithmetic. operations in binary arithmetic, namely, 1. Binary Addition 2. Binary Subtraction E | Like decimal number system, we can perform four types of t & 3. Binary Multiplication 4, Binary Division 1.3.1 Binary Addition ‘The addition of two binary numbers is performed in exactly the same manner as the addition of decimal numbers, The following 4 rules are used in adding the 2 binary numbers. They are, Rules: 04060 Orlel 14081 141s 10 60 with a carry of |Fvampirs ie. a Add (9), « (ED), using binary aditition LOOLoe Vii ls L1000--24 ti) Add CLLOLE), + (10.110), 1 Lon 1 : 4 110 110.001 (11.011), + (10.110), = (110.001), It is not necessary to consider the addition of more than 2 binary numbers at a time, because in.all digital system the circuit that actually performs the addition can handle only 2 numbers at a time, When more than 2 numbers are to be added, the first 2 are added together and then the sum is added to the third number and. so on. Addition is the most important arithmetic operation in digital system. The operation of subtraction, multiplication and division are performed in most of the modern digital computers in terms of addition only. 1.3.2 Binary Subtraction ‘The subtraction of binary numbers is performed in exactly the same manner as the subtraction of decimal numbers. The following 4 rules are used in subtracting 2 binary numbers. Rules: i 0-0=0 F 1-0=1 iy . 0-1=1 with borrow 1 5 1-is0 Scanned with CamScannerNumber Systems 000 Examples; i) (Nyy ~ Gg Using binary subtraction 1117 101-5 010-r2 (111),-(101), = (010), ii) (1101.11), - (111.01), 1101.11 -> Minuend 111.01-» Subtrahend 110.10->Result (1101.11), - (11.01), (110.01), 1.3.3. Binary Multiplication A binary multiplication operation requires a binary _ multiplication operator (x) and two operands (multiplicand and multiplier). The following 4 rules are used in binary multiplication Rules: Ox0=0 Ox1l=0 1x0e0 Ixlel Example (00), x (101), | ‘Multiplicand 1101 | Multiplier LOU | Vist | 9000 1por : | ‘oagei (1101) (102), =(hoa0001), Scanned with CamScannerinary Division The process for dividing one binary number (divi, another (divisor) is the same as that which is followed idengy x numbers. The following rules are used in binary ate dec Rules: : d/lst 1 O/1=0 Examples: : 1 i) (1001), + (11), iL i 11j1001 At Vb (1001), + (1), =), Mk : ae fi) (1010.01), + (10), 101,001 190}1010.01 (1010.01), +(10), = (101.001), fia] COMPLEMENTS Complements are inverse ofa particular number, which at used in computers for simplifying the subtraction operation and for logical manipulations. “There are two types of complement for each base-r system. Scanned with CamScanneri, 20 Digital Sr ecormneniermenmntnennmerttatn onl Prag 7 “3.6 | DIGITAL LOGIC GATES TF Logic gates are devices, whore input (4) and wand Otte i represent boolean or binary values as voltages, ‘The logic gates are basic building blocks of digital systems 1, AND gate An AND gate is a digital circuit having two or Mote iy and a single output, An AND gate operation is similar as pn, multiplication of 1's and 0's. “tT Symbol: Inputs Truth table: ‘The output of an AND gate is one only, if all the inpots # ‘one, If any one of the input is zero then the output is zero. 2. OR gate An OR gate is a digital circuit having two or more inp and a single output. Symbol: tngas® = Ovrpet Truth table: Scanned with camscater“An OR gote output will be one only when any one of the «gone. Hall the logic inputs of the OR gate is zero then the cope 8 rere 3 NOT Ste has only one input and one output. the Not zown 2s inverter gate or complement. The output of the js the complement of the input signal. s__}>-—A ontpat [a4 [a‘l | Lito} If the input is zero, the output is one. If the input is one, cutput is zero. + NAND Gate ‘The NAND gate isa digital circuit having two or more inputs zd2 single output. The NAND gate is a combination of AND gate 2A NOT gate. ole im the ; The NAND function is the complement of the AND "ction, as indicated by a graphic symbol which consists of an AND ‘bal followed by a small circle. a ith Cam$cannerA (A.B) Inputs B Output Truth Table: A | B[X=AB 0; 0 1 Oo} 1 1 1] 0 1 1 1- 0 5. NOR Gate The NOR gate is a digital circuit having two or more inpu and a single output. The NOR function is the complement of the OR functio and uses an OR symbol followed by a small circle. Symbol: ' toga? ay Opn B Truth Table: A | B | X=A+B 0 0 i o.f 1 0 1.}| 0 0 1 1 0 1 then the If anyone of the logical inputs to the NOR gate is 0 then the output is zero. If all of the logic inputs of the NOR gate are output is one. ‘ rescence Scanned with CamScanner| Aooleart Algebra , 6, Exclusive -OR aa ‘The EX-OR gate is a digital circuit h; inputs anda single output. ‘The EX-OR gate has a graphic symbol similar to that of. the OR gate, except for the additional curved line on the input side. aving two or more symbol: ia ious J )—Satpat t YABB | 7 =AeB y Truth Table: ) A | B | AB'| AB! Y=A@B 0|0 0 | 0 0 OF) 0 1 1 1 0 1 0 1 1 1 0,0 i} If all of the logical inputs to the EX-OR gate are opposite then the output is one. If all the logical inputs to the EX-OR gate are equal then the output is zero. 7. Exclusive-NOR gate The equivalence or Exclusive-NOR gate is the complement of the exclusive - OR, as indicated by the small circle on the output side of the graphic symbol. Symbol: Inputs’* Output y-ABLAD B =AOB Truth Table: i A |B | AB | AB’ | Y=A0B 8 of] oj} o] 1 1 Ce Be 0 1{o[o]o]. 0 i[ ae fot 0. 1 Scanned with CamScanner