uits I: Dig xc Combinational Logic 3.1 Combinational Logic Circuit 3.2 Sequential Logic Circuit ST Boolean algebraic theorems are used for the manipulation of logical expressions. It has also been demonstrated that a logical expression can be realized using the logic gates The number of gates and the number of input terminals for the gates required for the fealisation of a logical expression, in general, get reduced considerably if the expression can be simplified. Therefore, the simplification of logical expression is very important as it saves the hardware required to design a specific system. Basically, digital circuits are divided into two broad categories: 4) Combinational circuits and 2) Sequential circuits 'n combinational circuits, the outputs at any instant of time depend upon the inputs present at that instant of time. This m eans there no memory in these circuits. There a other ty; hich outp au 'y have combinatioy The design requirement of following ways: circuits may be specified in one of 1) A set of statements. 2) Boolean expression 3) Truth table. which are in fact derived f ; ipoults from the basi 'Y discussed or some other © number of components us Ee 28S. As us ; I8ed Should be prin Sual in any engineering desig” Beast requirements etc. There can be mae 0 ensure low cost, saving in $P* ifferent ‘ ig? approaches to the des— M. Sc. (Sem. - | — Je _ “! iFaper 0) : (Physics) (Electronics) (PHCT-113) i its. One of these is the traditional method, wherein the given Boolean expression or the truth table is simplified by using standard methods and the simplified expression is realized using the gates. The other method normally does not require any simplification of the logical expression or truth table, instead the complex logic functions available in medium scale integrated circuits (MSI) can be directly used. With the help of Boolean expressions, we can wi | rite the relations between the input and output of the logical or digital circuits. Consider the Boolean expression, Y = (A+B)(C+D) CO Cy Bs y Ky] )— Y=(A#B)(C+D) Fig. 3.1: Logic Diagram for Y = (A+B)(C+D) in Boolean equation (1), Y is the output and A, B, C and D are called as literals or logical variables. The following methods can be used to simplify the Boolean expressions: 4. Algebraic method. 2. Karaugh (K) —map technique. 3. Quine - McCluskey method and 4. Variable entered mapping (VEM) technique. The K-map is the simplest and most commonly used methods. It is a manual method and depends to a great extent upon human intuition. Sequential logic is a type of logic circuit whose output depends not only on the present value of its input signals, but on the sequence of past inputs, the input history. This is in contrast to combinational logic, whose output is a function of only the present input. That is, sequential logic has state (memory) while combinational logic does not. In other words, sequential logic is combinational logic with memory. Sequential logic is used to construct finite state machines, a basic building block in all digital circuitry, as well as memory circuits and other devices. Virtually, all circuits in practical digital devices are a mixture of combinational and sequential logic. A familiar example of a device with sequential logic is a television set with "channel up" and "channel down” buttons, Pressing the "up" button gives the television an input telling it to switch to the next channel above the one it is currently receiving. If the television is on channel 5, pressing " Swit it to receive channel 6. a Perea csc circuit is a type of logic circuit, which is produced by combining ‘number of different types of logic circuits. Hence, it is called as combinational logic af r aut state of this circuit at a particular instant of time depends on the inputDigital Logic Circuits 1: Combinational Logi States at that the same instant. Combinational logic circuit never implements memg Circuits in it Hence, it is also called as real time functional logic circuit. |n digital electronics, basically there are two types of circuits: combinational logic circuits and Sequential logic circuits. In this chapter, we shall study four combinational logic Circuits: Multiplexer (Mux), demultiplexer (Demux), encoder and decoder. 3.1.1 Review of Boolean Identities: Understanding the logic circuits give us an effective tool in solving complicated logical equations. Following are the identities, in which we have to prove that LHS = RHS | Name of Identity Statement of Law Commutative law AB=BA A+B = BtA _ | Associate Law | (AB).C=A(B.C) (A+B)+C = A+(B+C) | Distributive Law | A(B+C)=AB+AC JANDlLaw [AO=0 — A1=1 | AtA=A AA=0 OR Law AtO=A Att =1 AtA=A AtA=1 | Inversion Law A=A | Other important Law A +(BC) = (A+B) (A+C) 7 A+(4B) = A+B | A+ (AB) =A+B | A+(AB) =A AtAB=A(14B)=A A.A+B)=aB Minimize or reduce Boolean expression AB+ AC +BC=AB+ AC Consider RHS side; i RHS = AB + AC + BC = AB +AC +BC A+a) Ses =AB+AC +BC (A+A) AB + AC + BCA + BCA SSence, AB +AC + BC = AB+AC eg + ABCD + ABD = BD Consider RHS side; ABCD + ABCD + ABD = BD[A T+ AC + A] =BDIA(C*+C)+A) =BDA +A) =BD = LHS Hence, ABCD + ABCD + ABD = BD A+AB + AB = AtB Consider RHS side; A+AB + AB =A+ AB + AB =A(1+B) +AB +KB (4+B) +AB +AB + AB SA+(A+A)B =A+B = LHS 1 "Hence, A +AB + AB = A+B ‘alAB +AB +AB =A+B Asc + ABC + ABT + ABC = AB + BC + AC Consider RHS side; Bc +ABC + ABC + ABC = ABC + ABC + ABC+ ABC =(A+A)BC + ABC+ ABC = BC + ABC+ ABC = BC + A[BC+ BC] = BC +A(B+C) =BC+AB+AC = AB+ BC + AC = LHS Hence, ABC+ ABC+ABC+ ABC = AB+BC+AC A+ AB + AB = A+B Consider RHS side; At AB +AB=A+AB+AB =A(1+B)+AB =A+AB (148) +AB +AB +AB +B (A+ A) =AB = LHS: Hence, A+ AB + AB = A+B3 +B) A+B AB+ AB +AB=A+B (A+ BC) (B+ CA) = AB + AC Consider RHS side; (A+ BC) (B+ CA) = AB + ACA + BCB + BCTA =AB+AT since BB=CT=0 =LHS Hence, (A+ BC) (B+ CA) = AB + AC (A+B) (A+B) = B Consider RHS side; (A+B) (+B) = AA + AB + BA+B =AB+BA+B B(A+A)+B =B+B =B =LHS Hence, (A+B) (A+B) = B SEnrEne (A+ BC) (B + C) = A(B + C) Bo Qo AB +AC + BB+ BCTic Circuits I: Combinational ,, : r Digital Logic a Ogi i ih Map to aaaign tvariable logic circuits like BCD er 3.4.2 Use of Karnaug! Segment decoder: (k-map): F i Karnaugh eo the need for the simplification of the Boolean expressions ang We have established the simplification using Boolean algebraic theorems i the algebraic method of a D aes Beivee itis rca to be sure that a logical expression can be simplified, There jg another technique, which is graphical, known as the K-map eee Provides 2 systematic method for simplifying and manipulating Boolean expressions In this technique, the information contained in a truth table or available in POS o, SOP form is represented on Karnaugh map (K-map). This is perhaps the mog extensively used tool for simplification of Boolean functions. K-map a graphical way of simplifying complicated Boolean expression. It is composed of an arrangement of adjacent cell of representing one particular combination of variables in a Product form, The k-map consist of 2” cells, where n is number of variables. Advantages of k-map: 1) Itis difficult to apply the law of Boolean algebra when number of variable are large 2) Use of Large number of Laws of Boolean algebra increases the chance of error because one have to remember all these laws and how apply them at correct place But by using k-map, it is not necessary to remember all laws, 3) K-map provide easiest way to Produce simpk o a ir chances of error. lest Boolean expression with minimum Two-Variable K-Map: Suppose we have a truth table like Table-1 and Table-2 Tablet: Table-2: 8 Y =| 0} of > 3) of alo =/ =] o} of > o] wo S| >| =| o| <) if 1 4 |.- Here is how to Construct the K-map, Begj Variables and their complements eo by drawing fu fig- of the hotzontalrowhasB folowear ee Vtical oly’ 3.2(a). Note the order In has Afoliowed by A, and ™a) e Fig. 3.2: Two variable K-Map Next, look for output 1’s in table-1. The first 1 output to appear is for the input of A = 1 and B = 0. The fundamental product for this is AB . Now, enter a 1 on the K-map as shown in fig. 3.2(b). This 1 represents the product AB cause the 1 is in the A row and the B column. Similarly, Table-1 has an output 1 appearing for an input of A = 1 and B = 1. The fundamental product for this is AB. When you enter a 1 on the K-map to represent AB, you get the map of fig.3.2(c). The final step in the construction of the K-map is to enter 0's in the remaining spaces. Fig.3.2(d) shows how the K-map looks in its final form. Here's another example of a two-variable map. In the truth table of Table 7.6, the fundamental products are AB and AB. When 1’s are entered on the K-map for these products and 0's for the Temaining spaces, the completed map looks like fig. 3.2(e). Three-variable K-Map: q Suppose you have a truth table like table-3. Begin by drawing fig. 3.3(a). It is especially important to notice the order of the variables and their complements. Table-3: x B G Y 0 0 0 0 0 0 1 0 0. 1 0 4 0 1 4 O 4 0 0 0 7 0 4 0 7 i 0 1 1 i {2 aes)Digital Logic Circuits ey Combinationay Logie atc tc oe AB B Re 7B] 1 AB AB AB) 1 1 AB AB AB AB (a) (b) Fig. 3.3: Three-variable K-Map The vertical column is labelled AB,AB and AB. This order is not a binary progression instead, it follows the order of 00, 01, 11, and 10. It's done so that only one variable changes from complemented to uncomplemented form (or vice versa) Next, look for output 1's in table-3. The fundamental products for these 4 outputs are ABC, ABC and ABC. Enter these 1s on the K-map fig. 3.3(b). The final step is to enter O's in the remaining spaces fig.3.3(c). This K-map is useful because it shows the funda. mental products needed for the sum-of-products circuit Four-variable K-Map: Many MSI circuits process binary words of 4 bits each (nibbles). For this reason, logic manits ate offen designed to handle four variables (or their complements). Therefore the four-variable map is the most important. For constructing a four-variable map, Ist Us consider the truth table, table 4.8, The first step is to di —— _ oO any, e 0 0 (aad s [oJ 2 cama oO 0 oO =a 0 ol 1 wt |i — In table-4, the output 1s have these fundamental products,ABCD, ABCD, ABCD }BCDand ABCD. After entering 1's on the K-map, you will have fig.3.4(b). The final step offilling in 0's results in the completed map of fig. 3.4(c). TW | Sd) col cd @| Tol co) cb ow | Bo} cojed ee 2 | 0} 1] 010 = + * : Fe} o}] 1] 0/4 a “2 ae ap | o| o| o|o | be AaB, 0] 0] 0/0 Fig. 3.4: Four Variable K-Map SEnnicke K-map of logic circuit is1; Combinational Digital Logic Circuits K-map of logic circuit is Write the Boolean expression for it The Boolean expression for above k-map is K-map of logic circuit is | To] cd} cd J 1]o}o AB}9 | o Jo | o ABlo {ola |4 Blo Jo fo [a Write the Boolean expression for it The Boolean expression for above k-map is Y= ABCD + ABCD + ABCD + 4, Y= ACB(D + D) + ACD(B +B) _ Y=ACB + ACD BCDWrite the Boolean expression for it The Boolean expression for above k-map is Y= ABCD + ABCD + ABCD + ABCD Y= ABC(D + D) + ABC(D + D) Y= ABC + ABC y= AB(C+C) Y=AB 3.4.3 Binary - Gray code converter : Gray code: The gray code is a universal unweighted code meaning that the bit position do not have specific weights. It is not an arithmetic code. It is a 4 bit numeric code in which decimal number 0 to 15 are represented by 4 bit binary code. This code has very special feature that two consecutive codes differ in only one position. Hence gray code is also called as unit distance code. The gray code for the decimal number 0 to 15. Digital Gray Code Digits G3 G2 G1 Go 0 ° 1 o =| i 0 ios 0 4 0 5 0 (neue | i 0 8 1 9 11 i i 1 0 a) Binary to Gray code converter : A given binary number can be conve! jh the following steps: 1) Sorat the most significant bit (MSB) of the binary number. The MSB of the Gray code equivalent is the same as the MSB of the given eee de 2) The second most significant bit, adjacent to the MSB, in the Gray code number is obtained by adding the MSB and the second MSB of the binary number and ignoring the carry, if any. That is, if the MSB and the bit adjacent to it are both ‘1’, then the corresponding Gray code bit would be a ‘0’ 3) The third most significant bit, adjacent to the second MSB, in the Gray code number is oblained by adding the second MSB and the third MSB in the binary number aid ignoring the carry, if any. The process continues until we obtain the LSB of the Gray code number by the addition of the LSB and the next higher adjacent bit of the binary number. The conversion process is further illustrated ‘step-by-step conversion of (1011)2 into its G. ited into its Gray code equivalent by gcing with the help of an example showing ray code equivalent Binary 1011 Graycode 1--- Binary 1011 Graycode 44-- Binary 1011 Graycode — 111- Binary 1011 Graycode 1110 The Boolean e: Xpressions for coy is Git = Bus erting N bits binary to gray code are: Gus= Bs By. Guat Bus ® By. For 4 bit code, above expressionea (Physics) (Electronics) (PHCT- Letus find gray code of binary (4 100), Given binary code in 1110. jeBy=1,B2=1,B,=1 Bo=0 Since, given code is 4 bit code. G3=B3=1 G=B© B,=19 1=0 6=B,S 8-19 1=0 6o=8; © B=12 0-1 Gray code of Binary Number 1110 is 1001 Let us find gray code for (15)1o Given binary code for decimal (15);o is 1111. B=1 Bl =1 By=1 Bo=1 G,= B= G=B, © B,=121=0 6=8, OB, 19 1=0 6o=8, © p,=191=0 Thus, the gray code for (15)10 is (1000). Gray to Binary code converter:- A given Gray code number can be converted into its binary equivalent by going through the following steps: ; 1) Begin with the most significant bit (MSB). The MSB of the binary number is the same as the MSB of the Gray code number. 2) The bit next to the MSB (the second MSB) in the binary number is obtained by adding the MSB in the binary number to the second MSB in the Gray code number and disregarding the carry, ifany. F 5 3) The third MSB in the binary number is obtained by adding the second MSB in the binary number to the third MSB in the Gray code number. Again, carry, if any, Is to be ignored. sa ‘The process continues until we obtain the LSB of the binary number. conversion process is further illustrated with the help of an example shov ) conversion of the Gray code number 1110 into its u b) 3.14ic Circuits |: Combinational (, 1110 Its Binary is 4--- Gray code 1110 Its Binary is 10-- Gray code 1110 Its Binary is 101- Gray code 4110 Its Binary is 1011 : The Boolean expression to find binary code of a given gray code are By1= Gy. (ie.; record MSB as it is). Bu2= Bu © Gyo Bxs=By2 © Gys For this 4 bit binary code above expression can be written as To Find the Binary code for (1000) ex; ; ) expressed in gray code. Given Gray code is 1 its binary is, By = G3 =1 B= B® G=19 9-, 8,=B, Og, =199.,Its binary is; B;= G3 =1 B,=B) © 6,=19 1-0 B,=B, © G,=0% 1-1 Bo=B, © G,=19 o=1, Thus, the equivalent binary code for 1000 is 1011. lel and Combinational counter : Sequential Logic 4-bit serial : A serial adder performs addition of binary numbers in serial form. Below figure shows the circuit diagram of an n-bit serial adder. The two binary numbers to be added serially are stored in two shift registers A and B. Bits are added one pair ata time through a single full adder (FA) circuit. Here, SO stands for the serial output of shift register. so Shift register A Shift register 8 |