1. Implement the circuit F(A, B, C, D) = [I(O, 2, 5, 7, 10, 11, 13, 14, 15) using multiplexers and external logic gates. (30 points) a. Show the truth table in order of mux input groupings for each case below. (10 points) b. Show your work in creating the minimized Boolean POS expressions for each multiplexer. You may use any combination of K-maps and'or Boolean algebra. (10 points) c. Write a Verilog module for the case I circuit. Use bitwise operations for the external logic gates and named instantiation of the mux module. Assume the mux module already exists and has the following name and port list. (10 points) module mux4to1(input wire [1:0] s, input wire [3:0] dataln, output wire m); Case 1: A, B are the select bits. Case 2: C is the select bit.

1. Implement the circuit F(A, B, C, D) = [I(O, 2, 5, 7, 10, 11, 13, 14, 15) using multiplexers and external logic gates. (30 points) a. Show the truth table in order of mux input groupings for each case below. (10 points) b. Show your work in creating the minimized Boolean POS expressions for each multiplexer. You may use any combination of K-maps and'or Boolean algebra. (10 points) c. Write a Verilog module for the case I circuit. Use bitwise operations for the external logic gates and named instantiation of the mux module. Assume the mux module already exists and has the following name and port list. (10 points) module mux4to1(input wire [1:0] s, input wire [3:0] dataln, output wire m); Case 1: A, B are the select bits. Case 2: C is the select bit.

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

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…
Using the truth table below ( An example sum-of-products expression is (A+B+C)(A+B+C')(A+B'+C)(A'+B+C).) a. Write a product-of-sums Boolean expression bexp4 for the output ? of the truth table b. Draw a circuit that is a direct translation of bexp4 without any simplification. For the circuit, use a layout that is analogous to the layout of the sample circuit below (where the and and or gates are appropriately swapped).
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)
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)
Simplify the following function, and implement the same with two-level NAND gatecircuits: (?, B, C, ?) = ??′?′+?′?+???+??′?+?′?′?′.
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…
Apply Boolean algebra simplification rules to Simplify the Boolean expression ? = ?'? + ??' + ?'?? . Draw the circuit diagram of the simplified term using minimum number of gates .
B) redraw the circuit from (a) using only NAND gates.
Implement the following Boolean function F, together with the don’t-care conditions d, using no more than two NOR gates: F (A, B, C, D)=Σ(2, 4, 10, 12, 14,) d(A, B, C, D)=Σ(0, 1, 5, 8)Assume that both the normal and complement inputs are available.
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).
Output of F(x, y, z) For the truth table above, what logic circuit below represents it?
Simplify the Boolean function with K-Map method and implement the logic circuit using minimum number of NAND gates. F(A,B,C,D) = Σ m (0,1,3,4,7,8,11,12) + Σ d (0,5,14,15)