1. Simplify the following Boolean expression using K-map and draw the F(A,B,C)= _m(1,2,3)+ Ed(5,7) 2. Implement a 32:1 multiplexer using following instructions: a. Use a combination of 16:1, 8:1 and 4:1 multiplexer. b. You are allowed to use only one 16:1 and one 8:1 multiplexer. Identify the correct number of select bits in each multiplexer used. C.

1. Simplify the following Boolean expression using K-map and draw the F(A,B,C)= _m(1,2,3)+ Ed(5,7) 2. Implement a 32:1 multiplexer using following instructions: a. Use a combination of 16:1, 8:1 and 4:1 multiplexer. b. You are allowed to use only one 16:1 and one 8:1 multiplexer. Identify the correct number of select bits in each multiplexer used. C.

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

First, you must create a logic circuit using only basic gates such as AND, OR, NOR, NAND, NOT, etc. to implement an ADDER capable of adding two 4 bit binary numbers. Second, you must create a logic circuit using only basic gates such as AND, OR, NOR, NAND, NOT, etc. to implement a Subtractor that is capable of subtracting the second number from the first, by converting the second number into its 2's complement form and then adding the resulting number to the first number. You do not need to worry about accomodating the addition or subtraction of negative numbers. Finally, create a limited ALU (Arithmetic logic unit) circuit using Logism that implements a Full Adder circuit capable of adding 2 – 4 bit binary numbers and subtracting 2- 4 bit binary numbers. Also, implement the ability to select a bitwise AND operation and a bitwise OR operation. For the ALU it is acceptable to use the Adder and Subtractor circuits that are listed under the "Arithmetic" folder in Logism. (Logism tips and…
Draw unsimplified circuits to implement the following Boolean expressions. Use many-input AND, OR, NOR, or NAND gates where they are useful (instead of using only 2-input gates).
1. DESIGN A COMBINATIONAL CIRCUIT THAT GENERATES THE 9'S COMPLEMENT OF A BCD DIGIT.2 DESING A COMBINATIONAL CIRCUIT THAT COMPARES TWO 4-BIT NUMBERS B AND C TO CHECK IF THEY ARE EQUAL. THE CIRCUIT HAS ONE OUTPUT, Z, SO THAT Z = 1 IF B = C AND Z = 0 IF B IS NOT EQUAL TO B.3. A COMBINATIONAL CIRCUIT IS DEFINED BY THE FOLLOWING THREE BOOLEAN FUNCTIONS. DESIGN THE CIRCUIT WITH A DECODER AND EXTERNAL GATES F1= X'Y'Z' + XZ F2= XY'Z' + X'Y F3= X'Y'Z + XY *HINT: OBTAIN THE KMAP AND TRUTH TABLE
You have to design a logic diagram which can implement the complement of following by using NAND gates ONLY. F (A, B, C, D) = Σ (0, 1, 2, 3, 6, 10, 11, 14)
Implement using Multiplexer 8:1 with residual variable. Please draw it using the logic gates, the circuit diagram. Do not draw the multiplexer chip per se. F=min(1,4,5,13,14,15)
Draw a circuit that implements a 3-bit Adder that takes two 3-bit numbers as input, each on 3 input lines and outputs a 4 bit number on 4 output lines. You may use the Half Adder, the Full Adder and the following gates: NOT, AND, OR, XOR. Make sure to clearly label the interface wires on your diagram and the types of gates you use.
Create a logic circuit using only basic gates such as AND, OR, NOR, NAND, NOT, etc. to implement a Subtractor that is capable of subtracting the second number from the first, by converting the second number into its 2's complement form and then adding the resulting number to the first number. You do not need to worry about accomodating the addition or subtraction of negative numbers. Also, create a limited ALU (Arithmetic logic unit) circuit using Logism that implements a Full Adder circuit capable of adding 2 – 4 bit binary numbers and subtracting 2- 4 bit binary numbers. Also, implement the ability to select a bitwise AND operation and a bitwise OR operation. For the ALU it is acceptable to use the Adder and Subtractor circuits that are listed under the "Arithmetic" folder in Logism. (Logism tips and tricks are useful here for multi-bit pins, and how to set up different gates to support more than 1 bit. If using YOUR adder or subtractor circuit in your ALU that is not only acceptable…
Design a circuit with a 4-bit BCD input A, B, C, D that produces an output W, X, Y, Z that is equal to the input + 3 in binary. For example, 9 (1001) + 3 (0011) = 12 (1100). The outputs for invalid BCD codes are don’t-cares. Write the truth table and the Karnaugh maps used to simplify the Boolean expression!
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
1a. Draw a circuit diagram using appropriate logic gates to implement a 3-bit comparator. Identifythe gates used in implementation and show its usage to compare two 3-bit words by writing thetruth table. b. Write the Boolean expression for the following 4 input circuit. Include sub-expressions foroutputs of each gate. c. Complete a truth table for the previous logic gate circuit in part b. d. Write the Boolean expression for the new circuit below. Then, simplify the following logic circuitusing the theorems in Boolean algebra. Show the steps clearly and specify the law used in eachstep. Finally draw the simplified circuit diagram.
3(a): Consider the following circuit, which uses two D flip-flops with falling edge triggers along with -bit full adder. The flip-flops are controlled by a single clock, C. Suppose C, Q0 and Q1 all initially have the value 0. First, fill in the blanks in the "i " = 0 (initial state)" row to show the values of D0 and D1 at this initial time (assume the results of the adder have had time to stabilize) . Next, show the values of Q0 , Q1, D0 , and D1 once they have stabilized after the ith falling edge of the clock, where i ranges from 1 to 4. Note that both the A and Carry In inputs of the adder are (Q not ) Q'0 not Q0 None of these first four rows should be the exactly the same.
B) redraw the circuit from (a) using only NAND gates.