Chapter4-SoutheasternLouisianaUniversity.docVIP

Chapter 4 Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept signals from the inputs and generate signals from the outputs. Both input and output data are represented by binary signals. For n inputs variables, there are 2n possible combinations of binary input values. Since a variable in a Boolean expression may appear primed or unprimed, it is necessary to provide an inverter for each literal not available in the wire. An input variable may appear in two wires, supplying normal and complement forms to the input of the circuit. Design Procedure The procedure involves the following steps: The problem is stated. The number of available input variables and required output variables is determined. The input and output variables are assigned letter symbols. The truth table that defines the required relationships between inputs and outputs is derived. The simplified Boolean function for each output is obtained. The logic diagram is drawn. Adders The simple addition consists of four possible elementary operations 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, 1 + 1 = 10. The last operation sum’s length is 2. The higher significant digit is called carry. The carry obtained from two bits is added to the next higher-order pair of significant bits. A combinational circuit that performs the addition of two bits is called half-adder. One that performs the addition of three bits (two significant and a carry) is full-adder. Half-Adders Symbols x, y are two inputs and S (sum) and C (carry) for outputs. We now generate the truth table x y C S 0 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 The S output represents the least significant bit of the sum. The simplified sum of products expressions are: S = x’ y + x y’ when S = 1 C = x y when C = 1 Figure 4 –2 Page 118 shows the half-adders. The half-adder can be implemented with an exclusive-OR and an AND gate as shown in Figure 4 – 2(e). Full-Adders A full-adder is a com