MAIN QUESTIONS 1. Figure 1 shows a full adder combinational logic circuit which is used to add three bits and produce a sum and carry output. A full adder is an important component in binary addition. IS Full Adder Cin Cout Figure 1 The rules for binary output are shown below: 0 +0 = 0 0+1 = 1 1+0 = 1 1+1 = 0, carry 1 1+1 +1 = 1, carry 1 (a) Complete the truth table for each combination below. Output Input Cin B AS Cout 1 1 1 1 1 1 1 1 1 1 1 Table 1 (b) By applying minimisation techniques to your answer for part (a), derive the minimum logic expression for each output. Show your methodology clearly in your answer. (c) Using your answer to part (b), draw the minimised circuit for S using IEC symbols. (d) The engineer would like to implement the minimised circuit using only NAND gates. Using Boolean algebra, derive and draw a minimal NAND only circuit for Cout. You should show the steps required to find the NAND only minimal circuit.

MAIN QUESTIONS 1. Figure 1 shows a full adder combinational logic circuit which is used to add three bits and produce a sum and carry output. A full adder is an important component in binary addition. IS Full Adder Cin Cout Figure 1 The rules for binary output are shown below: 0 +0 = 0 0+1 = 1 1+0 = 1 1+1 = 0, carry 1 1+1 +1 = 1, carry 1 (a) Complete the truth table for each combination below. Output Input Cin B AS Cout 1 1 1 1 1 1 1 1 1 1 1 Table 1 (b) By applying minimisation techniques to your answer for part (a), derive the minimum logic expression for each output. Show your methodology clearly in your answer. (c) Using your answer to part (b), draw the minimised circuit for S using IEC symbols. (d) The engineer would like to implement the minimised circuit using only NAND gates. Using Boolean algebra, derive and draw a minimal NAND only circuit for Cout. You should show the steps required to find the NAND only minimal circuit.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given a 4-bit signed integer, design a circuit that outputs its absolute value. You can assume that the input will always have a valid output. (a) Draw a logic diagram of this circuit. You may use 4-bit half adder(s), 2x1 4-bit multiplexer(s), and any logic gate(s) in your design. (b) With the following Verilog code, implement your design above in Verilog. module half_adder (input [3:0] a, input [3:0] b, output [3:0] s); assign s = a + b; endmodule module mux(input [3:0] D0, input [3:0] D1, input S, output reg [3:0] O); always @(*) begin if (S == 0) O = D0; else if (S == 1) O = D1; else O = 4’bx; end endmodule
1 The following diagram represents a multiplier circuit that takes 2-bit binary numbers A1 A0 and BB1 B0 and produces an output binary number Y3 Y2 Y1 YO (LSB) that is equal to the arithmetic product of the two input numbers. Design this logic circuit using a decoder (You can use any type of a decoder). A1 Y3 Ao Multiplier Circuit Y2 (LSB) В Bo (LSB) |(LSB) Y,
Design a 2-bit comparator. The comparator input has two 2-bit numbers A and B. A consists of 2 bits a1 and a0. B consists of 2 bits b1 and b0. The comparator has three outputs Z2, Z1, Z0. a. Show the truth table for this comparator. b. Write the logic equation for Z2 that are true if only if A < B c. Write the logic equation for Z1 that are true if only if A > B d. Write the logic equation for Z0 that are true if only if A = B e. Show the logic design for this comparator using the minimum number of AND, OR, and Inverters. f. Verify your design using Logisim.
Answer this question, part (1), (2) & (3). Design a combinational logic circuit that converts a three-bit binary number from code A to code B, according to the table on the right. Answer the following questions: Code A Code B 000 000 001 001 011 010 010 011 110 100 111 101 101 110 100 111 Construct the truth table for the circuit. Derive the Sum-of-Products (SoPs) Boolean expression for each of the circuit outputs. Using Boolean algebra, simplify the expression you obtained in Part 2 above.
Design a combinational circuit that detects an error in the representations of a decimal digit in Binary Coded Decimal (BCD). In other words, obtain a logic diagram for a circuit that accepts the four BCD bits as input and whose output is when the inputs contain any one of the six unused bit combinations in the BCD code.
5. Design a logic circuit with 3-bit inputs A, B, C that produces an output W, X, Y, Z that is equal to the input + 6 (110) in binary. For example If the input is equal to 5 decimal then the output should be 5+6=11 decimal, the circuit will take all numbers in binary form and the output will also be in binary (101)B + (110)B=(1011)B
Q1. Construct the truth table of a full adder which calculate [S, Cout] = A + B + Cin where A = A1Ao is a 2- bit number, B is a 1-bit number, Cin is a 1-bit carry-in S = SiSo is a 2-bit sum and Cout is a 1-bit carry-out, and implement its circuit using no more than 20 logic gates.
AO- For the above given logic circuit, the output Y value is =1 when the inputs of A, B, and C are a. None of these O b. A=1, B=1, C=1 O c. A=1, B=1, C=0 O d. A=1, B=0, C=1
Design a circuit that uses 4-bit full adders and AND gates. Given two 8-bit signed 2s-complement numbers A and B and a binary input signal M, your circuit should produce an 8-bit signed 2s-complement result R, as follows: if (M == 0) R = A; else R = A + B + 1;
Question 2: A combinational circuit has 4 inputs (A, B, C, D) and 1 output (F). ABCD represent a majority function. The output of the majority function is equal to 1 if the input variables have more 1's than O's, otherwise the output is 0. a. Construct the truth table of the required circuit. b. Implement the minimized expression of F using 3-level all NAND gate circuit. Implement a 2-1Multiplexer using three-state buffers.
stion : 1/1 a Implement the function F (A, B, C) = E(1, 2, 4, 5, 7) a. Using a 2x4 decoder and any logic gates. b. Using a 4:1 multiplexer. P Type here to search 60
A clock pulse of 10 seconds period is used to clock a 3bit binary counter that counts from 0 to 7. The outputs of the three bistables are used as inputs to a combinational circuit that controls the sequence of the traffic lights , green, amber, red, amber&red. Green light is ON for 30 seconds. Amber is ON for 10 sec. Red is ON for 30 sec. Amber & Red light is ON for 10 sec and so on. (ON = Logic 1) Design the circuit by using D Flip flop and 12H6 PAL. Thank you.