Digital System and Binary Numbers Number System and Wes ar Signed Binary Numbers Binary Codes Cyclic Codes. A. Concept B. Long an: art D . 7 Answer Type Questions PALE-2 snnnisinnennninnnnnninnnnnmeee (I=1GA tO 184A) fhe Map Method upto Five Variables Don't Care Conditions A. Concept Outline : Part. B. Long and Medium Answer Type Que: 1-1A (ECICSIT-Sem-3) ‘Scanned wih CamScanner1-2A (EC/CS/IIT-Sem-3) Digital System & Binary Numbers PART-1 ‘Number System and Its Arithmetic, Signed Binary Numbers, Binary Codes, Cyclic Codes, Hamming Code. CONCEPT OUTLINE: PART-1 * The number system are as follows : i. Decimal number system. Binary number system. Octal number system. iv. Hexadecimal number system. * Complements : These are used in digital computers to simplify the subtraction operation and for logical manipulation. © One of the most common error correcting codes is the Hamming code. : © A code which has one bit change in successive code words is called cyclic code. Questions-Answers Long Answer Type and Medium Answer Type Questions Que id. | Define number system and also define signed and unsigned binary number ? Answer Number system : It is a language of digital systems consisting of a set of symbols called digits with rules defined for their addition, multiplication and other mathematical operations. ‘The classification of number system are as follows : Decimal number system : It has 10 symbols, so the base or radix of ig number system is 10. The 10 symbols are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. number system : It isa base 2 number system. The two binary its are land 0. al number system : It has a base of 8, it has eight possible digits 0, , 3, 4,5, 6and 7. decimal number system : It is a base 16 number system. It has its from 0t09,A,B,C,D,EandP. ~~ plements : These are used in digital computers to simplify the action operation and for logical manipulation. ‘Scanned with CamScannerital Logic Design 1-9A EECICSIT-Sem-g) 6 Signed binary number : Binary number that carry identification ag to their polarity is called signed binary number. Plus (+) and minus (~) signs for positive and negative numbers can be represented in a digital format. The three major signed binary notations are : Sign magnitude notation, 1’s complement notation and 2's complement notation. Unsigned binary number: In these type of numbers we do not consider the (+) or (-) sign and concentrate only on the magnitude (absolute value) of numbers. Ga 12, | Convert the following decimal numbers to their binary equivalents : i, (83), i. (79.515),, (109.125), iv. (225.225),, Convert the decimal number 225.225 to binary number. Thus, (83),, = (1010011), 0.515: , x2 = 1.030, 0 mmed 0.120x2 =0.240 c— 0 0.240x2 =0.480, 0.480x2 =0.960 0.960%2=1.920" | (79),. = (1001111), (79.515), = (1001111100001), ‘Scanned wih CemScannerIAA ROOST Sem-a) : Digital System & Binary Numbe iii, (109,125), too or 20,600 0.600 x 2 =1,000 co 0.000 x 2 =0.000 Thus, (109), = 1101101), (109,125), = (1101101,0010), iv, (225.225), 0.225 x 0.45 x 0.90 x 0.80 x 0.60 x 0.20 x 0:40 x 0.80 x 06x 221.2 (225.225),,—> (11100001.001110011), Que 1.3, | Convert the following : i 62. g= Oye? Oe ii. (BC 6)yg = Og = Oz AKTU 2012-13, Marks 05 Answer i 62.T)y = Oyg = Or 110 010 111 -» «0011 0010 .1110 => (82.E),, 6 2 57 (62.7), = (82.E),¢= (00110010.1110), BC6),5 = yo = 2 (BC6),_ = 11 x 16? + 12x 161 + 6 x 16° = (3014).9 (3014), )= (101111000110), Que Represent the decimal number 6in (i) excess-3 code, (ii) BCD code, (iii) Gray code, (iv) 8421 code and (v) 2421 codes. AKTU 2012-13, Marks 05 ‘Scanned with CemScanner1-6 A (EC/CSAT-Sem-3) _——— = Answer i.* Excess-3 code: Ss 6 tin BCD) = 0110 +3 oon 9 = 1001 Mie BED code: (6); = 0110 in BED) Gray code (6), = 0110 oi 01 D Gray code = 0101 0} Ol iC 8421 code: (6), = O110 (gy -o-1= 1010 vy. 2421 code: z42a% 1100 Que 1.5. | Convert the following numbers into desired base = (AGBFS),, = (2), = (2), i Jeray 5) using 2's complement AKTU 201. Marks Answer i. (AGBFS),. = (101001101011 11110101), = (1111010111 10000011 1D geay ii, 7-1 ii, (17-135) 17 in binary form = (10001), 135 in binary form = (10000111), scomplement of 135= 01111001 Now, adding 17 in binary form = + 00010001 10001010 As there is no carry, the answer is negative and is in the 2's complement form. The answer i ~ (2's complement of 10001010) = -(01110110), Thus the answer is ~(01110110),, ie.,(~118),)- 7 Que 1.6. | Add the following numbers: (ABC),,+ (CDE), ii, (7D y+ (107), ‘Scanned wih CemScannerL (ABCiyg = 1010 10111100 fin binary) (CDE), = 1100 1101 1110 . (ABO), + (CDE), = 10111 1001 1010 ea = 000 111 111 (in binary) = 00) 000 111 (Tyg + UOT),¢= 010000111 (206), Que 1.7. ] Represent the unsigned decimal number 965 and 672 in BCD and then show the steps necessary to find their sum. Taawer | ‘The BCD representations of the given number are as follows 1 % 1001 ono 0101 0110 6111_ 0010 wat 13010111 2 Since, F > Band D >9, ce.,snvalid BCD, the (O10), in F and D, w mt 010111 a eee. ee 11 Valid BCD ‘00010110 1 6 Equivalent decimal Hence, the sum is 1637 Que 18. 1 ‘The solution to the quadratic equation x - ILx +2220 aro x a8 and so 0. What ia tho hewn of tho nambor syeten used ? AKT 2012-13, 2015-14; Marks 05 > ber is b. The given quadratic e« uation is the base ef the num tx? - Thr + 224,50 ALB of quadratic equation ts, x= Sand tir equation formed with these roots § : tx Br ~ 6) w x8 (64 Bx (EX BD (1.8.2) eg, (1.8.2) with the given quadratic eg. 18) (Dyq VA, ‘Scanned wih CamScanner1-7 A (BCICSATT-Sem-3) ee pix 14 box ls bel B8),0 pix 24 box? abe L Hence, the hase of the number syst Que 1.9. | Perform the following, subtract method : @® _a1000- 01001 > 001.1001 - 0001.1110 v Answer () Assuming. X = 01000, 1's complement also, em is 8. tion using 2’s complement 01001 \ 10110 2's complement Difference = 11111. ‘There is no end carry _ (2's complement of 1111) = ~ (00001) i Assuming, X= 0011.1001, ¥ = 0001.1110 1's complement Y = 110.0001 +1 110.0010 011.1001 1110.0010 0001.1011 discard carry Since, carry is generated, answer will remain same, i.c., 001.1011 Geiie] P A Get —- the binary codes. Show the classification of binary codes in tabular format, ea 1. Code is the representation s of v1 5 coae tery ereamution of rox ofsymbols, words, or letter codes 2 These binary codes are used for the Greait, computer applications, in digit 2s complement Difference Asthe ry numbers so, we call it as the binary designing and analysis of digits! ‘al communication, The codes” ‘Scanned wih CamScanner1-8 A (EC/CS/IT-Sem-3) Digital System & Binary Classified into certain following categories : i Weighted codes Non-weighted codes Reflective codes Sequential codes Alphanumeric codes Error detecting and correcting code: ® Since, all these codes use only 0 and 1, soit is easier toimp! binary codes can also be used for representing the nun the alphanumeric letters. @) The classification of codes can be composed in tabular form which is as follows : aay pp Codes Weighted Reflective | Alphanumeric codes codes codes ¥ Ni a ©2421 * Ascl Non- Binary BCD onercighted | Feces 3 | * EBCDIC ©8421 * Excess-3 Sequential codes ©2491 * Gray +8421 « Excess-3 Fig. 1.10.1. © Weighted binary codes are those which obey the positions! weight the number to represent. In non-weighted codes, the positional weights are not assigned. In reflective code, the reflectivity is desirable. For example, in 9's complement subtraction, ie., code for 9 is the complement for 0, code for 8is complement of 1, 7 for 2, 6 for 3 and 5 for 4. In sequential code, each succeeding code is one binary number greater than the preceding code. ‘The alphanumeric codes are designed to Tepresent numbers as well as TS. e@® @ ®@ 10} The error detecting and correcting codes are used to detect and correct the error like 0 may change to 1 or vice-versa by using some special codes which possess the capacity to detect and correct the error. 1411, | Represent decimal number “-13” in all three methods of gative binary number representation using eight bits. AKTU 2011-12, Marks 05 ‘Scanned with CemScanner1-9 A (ECICSAT-Sem-3) Digital Logic Design Answer Given, number is (- 13),, i. Sign magnitude: (-13),, = (10001101), ii. Using 2's complement : (13),, = (00001101), 2s complement = (2)* ~ (00001101), = (100000000), - (00001101), (13), = 11110011), Using 1’s complement + (13),, = (00001101), 1's complement = (2)*~ 1 - (00001101), = (11111111), - (00001101), (13), = (11110010), Que 1.12. | Define cyclic code. Is Gray code a cyclic code ? al 1. When a bit pattern of two consecutive numbers differ in only one bit position, these codes are called cyclic codes. 2. Cyclic code forms a subclass of linear block codes. 3. An (n, k) linear block code C is called a cyclic code if it satisfies the following property : Ifan n-tuple D = (Ug, Vyeony Upp) 2112.1) is a code-vector of C, then the n-tuple Oy shies VP = Wy .Up, VpnnsBy_g) which is obtained by shifti: i ‘i i eh i obtained by shifting v cyclically one place to the right, is also a (i= OEE Oye Unni weer gy yee Dp y+ (1.12.2) is also a code-vector of C, The ode word n can be represented by a code polynomial as Vix) = Uy yx +022 44 y Theorem: If g(x) is a polynomi i ¥" +1, then, g(x) generates an (n, Polynomial VG) for a data vector D= (de a i Vis = Do ato 0), d5,d, _,) is generated by An example of cyclic code: (1.12.4) n-1 (1.12.3) ‘Scanned wih CemScanner110A (CICHAY Digital Syetom & Binary Numbers Trott Heean be ween that the code 1011, 1101, 1110, 0111 is obtained by a cyclic whifl of n-Luple 1011 (n= 4),The code obtained by rearranging the four words in uluo weyeliccode, Thus 1011, 1110, 1101, 0111 are als cyclic codes. You, Gray code in a eyelic eode an onsecutive bit changes only one bit ponition, Que 1.13, | Consider a (7, 4) cyclic code. The generator polynomial for this code is given as G(x) = 1 +x +2, Find all the code words of thin code, Answer (> Given, Gx) = Lex txt Qt" row of generator matrix is given by 24 Rc) = Qilx) Gx) Here n=7, k=4 and m=n-h=7-4, m=3 xT" Rix) = Qix) Gx) G) Wor t=1 x9 + Rix) = Q(x) Gx) Gyo) =x e041 x4x41 xtexed y= 2x54 x4 +2) [By using Modulo-2 subtraction] ext exten x+04x41 x%+ 1 remainder Qe) +x+1 Rix) =x +1 x4a2e LeGtees Dex 4) 1" row polynomial => xoaxt ed] ” 2°4 row polynomial => x exaxe] 3" row polynomial ‘Scanned wih CemScannerDigital Logic Design 1-11 A (BO/CSIT-Sem-3) xe pbgits xt la? xl ot 100 0/10 1 Hence G-|0 10 01111 01071 O11 0 000 1,01 1 5. C=DG D=(0 0 0 0} C\=D,G=10 000000) -at. fee yfotoouia Gar 0.9 A lg ghar ara a é 1001007 =l0 001014) Similarly calculating for other messages Message block ‘Code word vector _ 7 0 0 0 Oo 0 0 0 0 0 o 0 0 1 Oy) 0 0 1 0 1 1 o 0 i i) cv) 0 1 0 1 1 0 o 0 1 1 i) 0 7 1 1 0 1 0 Z 0 i) 0 1 0 0 1 . 1 0 a 0 1 0 1 0 7 1 0 0 ) 1 1 0 0 z 1 0 0 0 1 o 111 o 1 1210 1 0 - 0 0 0 1 0 0 0 1 0 1 He20s 10> ot 10 0 11 1 °0 10 1 0 a0 0 0 10 i 10 1 10 0.0 1 1 0 0 1 1000 1 0 pio 7a 1 1 0 10 01 1 11 °0 11101 00 Totsi id LMiloiiti. 141 Que 1.14. | Prepare Hamming code for the message “01001001010” assuming even parity. Also explain error detecti oti capabilities at the rect apapeeenere eiver by assuming an error in any one of the AKTU 2015-16, Marks 10 received bits. Answer 1. 11-bit data word : 01001001010 We include 4 parity bits with 4 i Tobit ehgees he 11-bit word and arrange the ‘Scanned wih ComScanner=0 XOR of bi 10, 11, M4, oSoeososovaieo \ i MM, 159 ve1@0 Soedeigo0eieod 1 G2 Substituting the 4 parity bits in their proper position, we obtain the 15-bit composite word stored in memory, Bit positio of rfofalifofofifayofo]ifo fifo ri2}3s]s{sfe[z]sfo [rolafitisfishs are read from memory they are checked again for ‘y is checked over the same combinations of bits, including the parity bit. : @® The 4 check bits are evaluated as follows : ¢, XOR of bits (1, 3, 5, 7, 9, 11, 18, 15)=0 ", = XOR of bits (2, 3, 6, 7, 10, 11, 14, 15) = 0 C, = XOR of bits (4, 5, 6, 7, 12, 18, 14, 15) = 0 KOR ofits (8, 9, 10, 11, 12, 18, 14, 15)= 0 eck bit designates even parity over the checked bits and a 1 s odd parity. Since the bits were stored with even parity, the = 0000 indicates that no error has occurred. However, if the {bit binary number formed by the check bits gives the ‘the erroneous bits. Je, consider the following three cases : 3/4) 5/6] 7/8} 9) 10) 11/12 13] 14} 15) fola}1fo{ofafalof ofa [o | 1] 0|No Error 1/1}0]0/1}1]0]0}1]0 | 1 | 0 |Errorin bit 3} 0/0)0]2} 1) 0] 0] 1 {0 | 1] 0 [Error in bit 5 \ ‘Scanned wih CamScannerl | 1A (ECCS. fod that ean be corrected is detected, but tha! ‘orror ocourred in the Py bit. IPs, Dut is not guaranteed | Quedas, | Forthe Hamming code 1001101001 received at the receiv cond, correct this code for orror ifuny ? [ARTU BOIE16, Marks f oa” ‘Scanned wih CamScanner1-14A (EC/CS/IT-Sem-3) Digital System & Binary Numbers Answer 1 3. 4. Given, Hamming code received = 1001101001 Pil Po| Dsl Ps| Ds} De| Dr] Ps| Do] Dro! 1} o}o}a}afofifofof.1 Let code is sent and received on the basis of odd parity. Therefore, we can find the correction bits as follows : C\=EXOR (P,,Ds,D5,D,,Dy)= EX-OR (1,0, 1,1, 0 C,=EX-OR (P,Dy,DgyDyDyq)= EX-OR (0,0, 0,1, 1 C,=EX-OR (P,, Ds, Dgy D;) = EX-OR (1, 1,0, 1 Cg=EX-OR (Py, Dg, Dyo, Dy) = EX-OR (0,0, 1) =0 Thus error bit location is C,C,C,C, = 0010 Thus error is in 2™ bit. Thus correct code is 1101101001. Que 1.16. | Detect and correct error (if any) in the following received even parity Hamming code word 00111101010. Also find out the correct message. AKTU 2011-12, Marks 05 1 2. The received Hamming code word = 00111101010 ‘The parity bit required is determined by deontke1 n= number of data bits A = number of parity bits ince, the Hamming code word is of 11-bit, i., n+h=11 2212 e, number of parity bit required, k = 4, (P,, P,, Py, P,)- in this received Hamming code, number of data bit is 7 ity bit is 4. Hamming code can be represented as Pr | P. [Ds | P| Ds| De | Dz | Ps.| Po] Pio] Pn ofofi}a]{afifofi]o}{2] 2 e check bits can be determined as C,=P,®D,@D,@D, OD, 2D, =00101006000=0 where, and number ‘Scanned wih CemScannerDigital Logic Design 1-15 A (EC/CS/IT-Sem-3} C,=P,®@D,®D,®D,@D,,2D,, @101800160=1 C,=P,®D,@D,®D, 161610021 C,=P,®D, OD, OD, 1806160=0 7. Hence, the check bit is 0110, this indicates that the number at 6* location ie., D, is an error. Hence, itis given 1 and it should be 0. Therefore, the correct message bit is 00111001010. \ Aue 1.17. | Design a parity generator to generate an odd parity bit for a 4-bit word. Use EX-OR and EX- OR gate. AKTU 2012-13, Marks 10 Answer 1. The circuit that generates the parity bit in the transmitter is called parity generator. The circuit that checks the parity in the receiver is called a parity checker. 2. Consider a 4-bit data whose input bit is A, B,C and D.So, the truth table for an odd parity generator is 4-bit message Parity bit ABC D P 00 0 0 1 ooo 1 0 oo 1 0 0 oo12 1 1 01 0 0 0 o 1 0 1 1 o1 1 0 1 011i 0 10 0 0 0 1001 1 17 1-+0 1 1041 #21 0 110 0 1 Tete Onrae 0 111 0 0 102-3 1 ‘Scanned wih CamScannerSomes) Digital Systom & Binary Numbers: Kanap and logic diagram : For = AOHOCOD Fig. 1.17.1, Gbiv odd parity, Fs AOBOCOD = EX-NOR (A, B, C, D) PART-2 _ The Map Method upto Five Variables, Don't Care Conditions, POS Simplification, NAND and NOR Implementation, Quine Mc-Cluskey Method (Tabular Method). CONCEPT OUTLINE : PART-2 * Basic theorems and properties of boolean algebra : net tet +y) +2 biage) = Gye a xy +2) ay + x2 ‘Scanned wih CemScannerTATA (ciogyp, Digital Logie DeSie™ uy Que 1.18. write i lean juction of boolean © ree minimization 1S imple! a short note on Karnaugh map, Aj, Show expression and how to mark pairs, He mented ? OW Bate, Answer ing the inf . is another way of presenting the information gy, 1, Kamaugh map maps are also known by the name K-map. to truth table. Thes ‘ a tral der the map for two variables. There may be four peg combinations within four squares. 2, Bach square represents unique minterms as shown in Fig, 1.18. , B NB B Wo 1 A) AB | AB 0] 00 | 01 4 OR of a 1} 10 | 11 2 3 ‘Fig. 1.18.1. For three variables : There are eight minterms for three binary variables, Hence the k-map consists of eight squares. BC. a BC, ABC Bo Bc BG =A Y00_01 1110 Al mp | m; | mg | my 0 | 000 | 001 | 011 | 010 oR of a a] A} mg} ms | my | mg 1} 100} 101} 111] 110 4| 5] a] Fig. 1.18.2. 3. The Hemap drawn in Fig, 1.18.2, for three variables is marked with Aeameers ineach row and each column to show the relationship betwee? the squares and the three variables. 4 a sample, ae Square assigned to m,, which corresponds to row ! hiner? ateaiec ea mae two numbers reconsidered, they give the , Whose decimal equi is For four variables. quivalent is 5. 1. The map for boolean funeti , acai minterms, hence the mani” ° four binary variables require six" 2. The listed terms are from 0, te i, i) “a relationship with the four va etistanns Themen she 3. In every square the numbers are ., ; - pat this square corresponds to that © written. The number denotes # number’s minterm. ‘Scanned wih CamScannerJAR ACROMSTD Sit Fein ® Biyary Nuibore » , a0 a ov ob An ” iy fom | my wy 00 | noon wot w S out fais oo mf my fw Png 4 fora foron four fore | ~ On s an wa mys MH Py ty J ttoo fon fave Pena ' " AR my | amy | my | mo vw J roof toot | von | too “ Que KIX | Minimize the given boolean fuvetion uxing Aap, ULB, CD) 6 Som BF 1) Auswer ABC + ACD 4 ACD + ABC Que 1.20] Explain with example using four variable map, How don't care conditions are implemented in K-map minimization ? AKTU 2012-18, Marks 05 OR Simplify the boolean function, F Qty x,y, 2) S38, 7 1, 15) which has the don’t care conditions (0b, yy 2) @ ECO, 2, 8) AKTU 2016-17, Marka 08, Answer 1. Consider the example, which has boolean function j Flex, Em, 3, 714, wh) and don't care conditions ‘Scanned with CemScannera uv BOAT Sug Digital Logie Benign Wot A tk ee de tr vc gd SA \ 2% ‘Uwratoracet Have a va ade vogue ad ake HE Kos cog © ggual 4 h uain tn al gn Ute ay ste: attorney vidhor Oo L a he A aap aiuaplitiga tion beabowe ta Bae bat wr mew Go 10 we A, 2h wla belt wf sft * g \ ws wy Pi * vt Oat Salt Yad al i Lok oat oad] Yel al er rad ofYal a ce (a) ye ye Wig L201 Kanap minimization 4 The mintorms of are marked by Uk Chose of ave anarked by ss anid | the remaining is (lled with O's, & Roget the simplified expression iM SOP torus, we must iaclude all five Us | inthe map, but we may’ or may tot include aay’ ofthe X's, depending: on the way the function is simplified, 6B tn Big. 1.20. 1), dow’t cave mintorms 0 and 2 ave included with the Us, resulting as Wee ye key! | 7 Unig, 120.10), dow't caro mintorms isincluded with the US, resulting | as Faye t's S The K-map in Fig. 1.20.1(0) is more feasible because, we have to use the minimum don’t care, Que 121, Simplify the following expression into product of sum (POS) form ABC + ABD + BCD ACD + GD + AB +ARCD Answer i ABC + ABD+ BCD b Let Y= aB0s aBDs BcD = ABC (D+ DV+ ABICL AKTU 2014-15, Marks 35 )D+(A+ A Bed ‘Scanned with CamScanner1-20 A (EC/CS/IT-Sem-3) Digital System & Binary Numbers = ABCD+ ABCD + ABCD + ABCD + ABCD + ABCD ¥ = m(7,9, 11, 12, 13, 15) Nov for POS form we will take complement function, ¥ =1M(O,1,2,3, 4,5, 6,8, 10,14) 3. Minimization through K-map is shown in Fig. 1.21.1. aXlc+p c+B G+5 S+D =—— 4 A+Blifory 0 0 | fo ot aT A+3B/L0 0 0 atl | Io R+E | vy} V Fig 19187 ¥ =(4+B)(A+CXC +D)(B+D) ii ACD + Cp + AB +ABCD L Let. ¥= ACD-CD~AB-+ ABCD = A(B+B)CD~(A-A)(B+B)CD + AB(C+C)(D+D)+ABCD = A(B-B)CD-(A+A)(B+B)CD + AB(C+C)(D+D)+ABCD + ABCD + ABCD + ABCD + ABCD Y=Em(1,5,8,9, 10, 11, 13, 14, 15) Now for POS form, we have to take complement function, ¥ = M(0,2,3,4,6,7, 12) 3. Minimization through K-map is shown in Fig. 1.21.2. ANc+pc+BE+bE+D Be << A=Bl go “apy w al al | i b Fig. 1212. ¥ =+ Das C)(B +C+D) ‘Scanned with CamScanner1-21 A (ECICSAT-Sem.3) [Gz] simplify the following boolean expression toa minimum Que 1.22. | Sim) number ofliterals. i. AC +ABC+ AC + AB i 4-15, Marks 3, di, (EP +z)eztay + wz AKTU 201 5 Answer i. AG +ABC+ AC let G +AC+ AB + ABC = O(A+A)+A(B+ BC) = 6+AB+0) (eae A= =G+AC+AB [G+ AC=(C+ AVC +0)] = C+A+AB = 6+A0+B) A+ 0 ii, (2) +z) 4z+ay +z Let Y= RI eet Sig) $2) +24aytuz +2taytuz tay t2(1+w) +ayteex Oytz [ev 140-1] ‘Que 1.28. | Simplify the following expression as much as possible: Fw, x, 92) = y'2! + w'x'2! + w'xyz! + wyz! and implement your result using universal gates only. AKTU 2013-14, Marks 2.5 Answer Flw, x, y,2)= y'2! + w'x'2! + w'xye' + wy2! ‘2! + wya! + w'x'z! + w'xyz! (y' + wy) + w'2'(x! + xy) ("+ w) + w'2'"(x' +y) ‘2! + wa! + w'x'2' + w'y2! ‘2! + w'y2' + wa! +w'x'2! 'Q' + wy) +2! Ww4w'') 'Y' + w') +2'w 4x’) 'G' +04 w +2) Gann 1+Azll we te 1+a'e) RI RI RI (2 A+ AB =A’ +B) ‘Scanned with CemScannerLRAGESTY Says) Digital Syxtomes Rinary Numbers — es tf Using NAND gate Using NOK gate ®) WEIL ws) Que 124 | Siaplity the tlowing bootean equation : YULB.CD)= ABCD & ABCD AKDT DIAG, Marks 05 | Answer | Given, VALCO DY = ABC Ds ABCD = ARDC CY since, C+Gar MAL BLD) = ABD ‘Que 125, | Express the following boolean finetion F ina sum of minterms and a product of maxterms, Pi y.2) = ayes) ee) ARTO 2011-19, Marks 05 Answer 1 Given 2. Byasociative property, Bysayenr+ Fy =F, Fe ENTH Pe eNEe ye Tey F=tMW,1,2, 4) Que 1.26. | Implement the following boolean function with NAND. Em, 2.3, 4,5, 7) gates, Fix y 2! El 1, The X-map simplification is shown in Fig, 1.26.1. ‘Scanned with CamScanner3 Hence, the simplified function is Be riya IT. Fig. 1.26.2. Que 1.27. | Simplify the boolean function ‘Y’ together with don care condition ‘d’ using K-map and implement it with two level NAND gate circuit. 1 2 3. Y=BD+ BCD+ ABCD ie] = BD+ BCD + ABCD = (A+A)B(C+€)D+(A+ A) BCD+ ABCD = ABCD+ ABCD+ ABCD+ABCD+ ABCD +ABCD+ ABCD Y= Em(5, 6,7, 10, 13, 14, 15) As there is not given any don't care condition so K-map is as shown in Fig. 1.27.1, Ape?.oo 011110 oo dl 1 a 2 a | 1 AE g rr {fa 12) ss dl 7 8) 9 1 10} Fig. 1.27.1, Y= BD+BC+ACD NAND gate implementation ; ‘Scanned wih CemScanner1-24.A (EC/CS/IT-Sem-3) 5 =p BD+BC_ gape pD— * (BD+BC) >= B—D, BC cL A—p_ AC AC c—4 D Digital System & Binary Numbers ACD Fig. 127.2. Que 1.28. | Minimize the given boolean function using K-map and implement the simplified function using NAND gates only. F(A,B, C, D) = E m(0, 1,2, 9, 11, 15) + d(B, 10, 14). AKTU 2011-12, Marks 05 Answer Minimization using K-map : 1 Given, FIA, B,C, D) = m(0, 1, 2,9, 11, 15) +d (8, 10, 14) cD AB\ joo__01| 1110 oo | a : 3 a 2 o1 asf | 11 1 * 12| 13 15] 14] ao |{* }[t 1_|{x 3} 9} 1 Toy Fig. 1.28.1. F(A, B,C,D)=AC+ BC + BD ea( 1.28.1) Implementation using NAND gates : Taking double inversion of eq. (1.28.1) F(A, B,C,D)= AC +BC+BD Using De-Morgan’s theorem : FIA, B,C, D) = AC + BC: BD, ‘Scanned with CemScanner1-25 A (ECICSIIT-Sem.3) Digital Logic Design A B ¢ D b/4/4]/o -p-5 Fig. 1.28.2. Que 1.29. | Whatis the significance of Quine-Mc Cluskey method or tabular method ? Answer | 1. The K-map method is suitable for simplification of boolean function upto 5 or 6 variables. As the number of variables increases beyond this, the visualization of adjacent square is difficult, as the geometry is more involved. 3. The Quine-Mc Cluskey or tabular method is employed in such cases, Consider the function, . F(A, B,C, D)=Em(0, 2, 3, 6, 7, 8, 10, 12, 13) for simplifying using tabular method. Ei Process of solving Mc Cluskey method : 1. The binary representations are grouped a section of numbers in terms of the number of 1's index as shown in Table 1.29.1, 2. Now compare each binary term with every term in the next higher category. + 3. Make the two number sectional combination which differ by one bit, 4. Write binary form of the minterm cell, . ws 5. Compare each binary term with higher adjacent cell and write the combination of 4 cell which are differ by 1-bit. Mark all combinations which are made by the digits of 4 cell. 7. Write the binary form of 4 cell and place a (_) in place of differ bit. ‘Scanned with CemScanner1-26 A (EC/CS'T-Sem-3) ‘Table L201, No. of| Minterms] Binary] Mintorma (Qeell), oo00] | 00.0) { os | 000 ai [oor m, |oo10} 26% {oto 1 2, Lov o1o m, | 1000} 810 | 10.0 812 | 100 2 m, | 0011 oo m, {oro} 12,13 J ort ie #10100) Jeeta,20) 8 (e110. my, | 1100 3 m, o1ll|, my | 1101 Digital Syntom ® inary Numbers Binary | Mintorm [Binary (deol) 08,0} 0.0] wwGe | Oot 8. Apply same process to the resultant stay, 9. All the terms which remain unchecked are the P's, Now propare a PI chart to determine essential prime implicants, 10. All the P's are represented in rows and each minterm of function in a column as shown in Table 1.29.2. 11. Put the © in each row to show the composition of minterms that make PI's. Table 1.29.2. Primo v v E Minterms| implicant m, my | my] My] yy ACD 8,12 ° ABCY | 12,13 o| 0 BDY | %,2,8,10 | o| © ° Acv | 2,3,6,7 Qo}o/0 J I prime implicant. 13, The column that contains a single dot © in ens Atick mark is put above each column which has only one © mark, ‘Scanned wih CamScannerDigital Logic Design 127A CECICSAT-Sem,sy 15. ‘The sum ofall EPI’ gives the function i F\A, B,C, D)= ABC + BD + AC Que 1.30. | Minimize the following switching function us: juine-Mc Cluskey method. ° Foy xy ty £9 x,) = Em, 1,2,8, 9, 15, 17, 21, 24, 25, 27, 31) AKTU 2016-17, Marketp] Answer Table 1.30.1, For obtaining all the prime implicants, No. of Minterms| Binary [Minterms Binary | Minterm ‘s minimal SOP form, ing Binary| Vs (2 cell) (4 cell) 0 my [00000] 01K |ooo0_ 91,89 |0_00¢ 1 m™ /00001) 0,2 [o00_0|1,9,17,25|_ooip ™z |00010) 0,8” |0_000|8,9,24,25] 100 4 m, _|01000 19% J0_001 2 m, 01001} 1,177 |_0001 m, .|10001] &9¥ Jo100_ my |11000/ 8,24v | 1000 3 m, |10101) 9,25 | 1001 ™s {11001 17,218] 10_01 4 my |01111) 17,25v |1_ 001 My |11013) 24,256 |1100_ 5 Ms, 11111) 25,27F 110_1 15,31E | _111] 27,31D |11 -14 ‘Scanned with CemScanner1-28 A (ECICSIIT-Sem-3) Digital System & Binary Numbers Table 1.30.2. Prime-implicant f a Pi 7 Minterm|m,| m,|m,|m,|m,|m,,|m,,|m,.|m,,|m,,\mz|_my, A elo olo B ° ° ° ° c o/o o]}o 2 eo] oe Ev © ° F ojo G ojo HY ole I ° © Jv jo ° K o|90 So the essential prime implicants are, Fey Xp Xy Fy %) = Et Hed F Aptytyty + EK Ms + HAAN Minimize the following using Quine-Mc Cluskey FW,X, YZ) = ¥ m(0, 8, 5, 6, 7, 10, 12, 13) +E d(2, 9, 15) AKTU 2015-16, Marks 15 FW, X, YZ) = m(0, 3, 5, 6, 7, 10, 12, 13) +E. (2, 9, 15) irst, we group the minterms according to the numbers of Is. ‘Scanned with CamScanner1-29 A (ECICSITT-Sem.) Digital Logic Design Digital Logic Design No.of |Minterms [Binary |Minterms Binary | Minterm Vs (2cell) (4cell) 0 m, Tooo0| 0,2 | 00.0 | 2%,3.6,7 | 1 am, |oo10| 2,3¥ | 001. )5,713,15" 11) 2 a o011| 2,6” | 0.10 | m, |0101| 2,10 | 010 | m o110}| 3,7” | 0.11 | | m, [1010] 57% |) 01_1 m, [1100] 5,18” | 101 3 dm, 1001] 6,7 | 011_ m, Olli 12,13 110_ m, |1101| 9%,13 | 101 4 dm,, 1111) 7,15*” | 111 13, 16*V | 11.1 | 2. Then, we prepare the table of prime implicants. Prime Minterm | implicant | m,|m, | m, | m, | m, | m,, | m Ns wiv | oo ° | XyZv | 2,10 ° | | WXY v 12,13 olo | wrz | 9,13 o1 Wry | 2,3,6,7 ° olo XZ¥ | 5,7, 13,15" ©} 5 3 | J FW, X,Y, Z) = WY + XZ + WR + XYZ + wx Que 1.82.| Use Quine-Me Cluskey (QM) method to solve the following function : F (A,B, C, D) = 2 m6, 7,8, 9, 10, 11, 14, 15) AKTU 2014-15, Marks 3.5 F(A,B,C,D) = 5 m6, 7,8, 9, 10, 11, 14, 15) Answer 1 ‘Scanned wih CemScanner0A (EC/CSIT-Sem-3) Digital System & Binary Numbers No, of |Minterms| Binary |Minterms|Binary| Minterm [Binary eel (cell) me | 1000] sv | 100_]8,9,10,11 | 10__ my | 0101] 8,10v | 10_0 |10,11,14,15) 11 m, | 1001} 5,7 |o1_1 my [1010] 9,11v [1021 3 m, | 0111] 10,11v | 101_ my, | 1011] 1014v | 1_10 m, [1110] 715) | 121 4, m, | ta1| ayisy |a_ia 4 iby | 111_ All the terms which are unchecked are prime implicants. Now, we prepare a prime implicant chart to determine essential prime implicant is as follows : al v viv 4 ‘Minterms |Prime implicants | mg | m, | mg |mg | mol, | m4) 45 ABDY 5,7 ° BCD ¥ 7,15 ° ° ° AB OY 8,9, 10,11 ejolojo ac UY 10, 11, 14, 15 o|O|1o)|o ‘Therefore, F(A, B,C, D)=AC+ AB+ ABD 3 Logic diagram : A c AC AB F = AC + AB + ABD ABD} Fig. 1.92.1, Que 1.83. | Use the Quine-Mc Cluskey method to generate the set of prime implicants for the following function : F(A, B,C, D) =Zm(0, 1, 4,5, 6,7, 9, 11, 15) + 4 (10, 14). ; Also obtain all minimal expressions for the function. Draw a logic ‘Scanned wih CamScanneras 4 Digital Logic Design 31. (ECICSAT. ge, diagram using only NAND gates to implement your best soluig, obtained. AKTU 2018-14, Marke ~ MO M4, Marks a) “Answer | 1. Given, FIA, B, C,D) = 5 m(0, 1, 4, 5, 6, 7, 9, 11, 15) +54 (10, 14) No. of |Minterms |Binary |Minterms Binary| Minterm Binary| Vs @cell) (cell) 0 m, 0000 0,1” 000_]} 0,1,4,5 O_o 1 m, [0001| 04v | 0.00] 45,67 |o1__ m, 0100 154 0_01 |6, 14*, 7, 15] -11_ 2 ms; 0101 19 001 ms, 0110 4,54 010_ m, 1001 4,64 01_0 dm, |1010] 5,7” | 01-1 3 m, O111 6,74 011_ my, 1011 6,14*v} (110 dm, |1110] 9,11 10_1 4 mh, 1111 10*, 11 101_ 7,16¥ | 111 11,15 lili 14*, 15 11li_ wee v Minterms| — Prime | m,| m, |m,| m,|mz|_m, Bs die implicants | ° See ane a acy 2145 lolololo A'B 4,5, 6,7 elo | 5 BC 6,144, 7,15 ol lolo ° BCD 19 ° } 1c! 9,11 ABC 2 'C! 10°11 ABC 3} ACD 11,15 Elle . ABC 14, 15 CI 7 ‘The essential prime implicant, ‘Scanned wih CamScanner1-92 A (ECICSA'T-Sem-3) Digital Syntem & Binary Numbers FA, BC, Di = A >) A A— p—— oO ip KE ep Ae copes . Fig. 1301. Que 1.34. | Minimize the following function using Quine-Me Cluskey method : FUA,B, C,D) = & m(0, 2, 3, 6,7, 8, 9, 10,13) AKTU 2011-12, Marks 05 Answer 1. Given, FIA, B,C, D) = ¥ m(0, 2, 3, 6, 7, 8, 9, 10, 13) ‘Table 1.34.1, No. of| Minterms] Binary |Minterms| Binary [Minterm| Binary V's (2eell) (eell) 0 m, |0000| 0,2¥ | 00_0 [0,2,8,10| _0_0 1 m, [0010] 0,8” | _000 | 2,3,6,7| 0_1_ m, |1000| 23” | 001. 2 m, | 0011) 26” | 0_10 m, | 0110] 2,10v | _o10 m, [1001] 89 | 100. my | 1010] 8 10¥ | 10_0 3 m, |o111| 3,7” | 011 fot ee |p 111014 tc ual a0 Trae 913¥ | 1.01 Table 1.34.2, v v|v|y viv Minterm| Prime | m,| m, | m,|m,|m, | m, | m,| m,.|m,; implicants BD'v | 02,810 | @| © ° © ACY 2,3, 6,7 ©|olojo ACD’ 89 ° 9,13 © ‘Scanned with CamScanner1283. ECICSIT Son sential prime implicant : / / a determined by searching of single dot Essential prime implicant i responding otha dat by pay. columns and select the prime implicant cor! the check mark in front oft, _ Fis, B,C, D)= BD+AC+ABC a ABC 8 ¢ Fig. 1.34.1. Que 1.35. | Minimize the following function by tabular method and implement the result using NAND gate only : Fw, x,y,z) = Em(1, 4,8, 9, 13, 14, 15) + d(2, 3, 11, 12) AKTU 201: Answer No. of |Minterms| Binary |Minterms|Binary| Minterm V's (2cell) (4cell) 1 0001 | 1,3” |00_1] 1,3%,9, 11% 0010 1,9¥ |_001] 8,9, 12%, 13 0100} 2%,3* |001_]9, 11%, 13, 15 1000 | 4,12* |_100]12*, 13, 14, 1 0011} 8&9” |100_ 1001 | 8,12 |1_00 2 dm,, | 1100] 3,11 | _o11 dm, | 1011] 911%” | 10.1 my | 1101} 913% |1_01 3. my | 1110 | 12%, 19¥ | 110_ 4 m,, [1111 | 12%, 14v [11_0 us, 16v | 111 13,15¥ [11_1 M4, Wy } 1171 ‘Scanned with CamScannerews S\ Fo,ry2=8 a [rR . p= ad "Fig. 1.35.1. ©O© rr ‘Scanned with CemScanner