Question

Designing digital logic gate, 3 bit two's complement as input x then output is F =...

Designing digital logic gate, 3 bit two's complement as input x then output is F = x^2-1.
a)F's Truth table
b)show F as SOP(Sum of product)
c)show F only using NAND
d)show F only using NOR
e)show F using only one Decoder and less gates as possible

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Design a sequential circuit that will negate four-bit two's complement integer. That is if, for example,if...
Design a sequential circuit that will negate four-bit two's complement integer. That is if, for example,if the input is 3 (in two's compliment representation) the output should be -3 (in two's complement notation). Start with the truth table, next write the formulas for each output in SOP form, next simplify formulas using Karnaugh maps and finally draw the simplified circuit. Thank you
For an OR gate, which of the following input combinations produces a LOGIC Low output? x...
For an OR gate, which of the following input combinations produces a LOGIC Low output? x = 0 and y = 0 x = 0 and y = 1 x = 1 and y = 1 x = 1 and y = 0 The device most commonly used for holding data is a ___________. In digital systems, a ___________ ____________ operation is a basic operation that consists of a transfer of binary information from one set of registers into another...
My question: what is the truth table for full-comparator?? Full question: Design a comparator circuit for...
My question: what is the truth table for full-comparator?? Full question: Design a comparator circuit for binary numbers using only NAND gates. It should take as input two numbers represented in standard binary, X and Y, and produce two outputs, G and L, which indicate that X is Greater than or Less than Y, respectively. If both outputs are zero, it indicates that the values are equal. Design a half-comparator, full-comparator, and a full four-bit comparator. With nothing more than...
1.Consider the function represented in sum of product form as F(x, y, z)=∑(0,1,4,6). Write the function...
1.Consider the function represented in sum of product form as F(x, y, z)=∑(0,1,4,6). Write the function F in product of sum form and minimize it using K-map. 2. Design a digital circuit (with minimum number of gates) with input ? = ?3?2?1?0 and an output ?. The output F should be 1 if A is divisible by either 2 or 3.
1) Provide a NAND circuit implementation for this function: F(x,y,z) = xyz’ + x’y’z’ + xy’z’...
1) Provide a NAND circuit implementation for this function: F(x,y,z) = xyz’ + x’y’z’ + xy’z’ + x’yz’ + xy’z + x’yz 2) A 3-bit parity check circuit will output a 1 for input having even number of 1’s. Provide the truth table, Karnaugh map for the minimized function, and circuit implementation using PLA.
Q.1.It is required to design an iterative combinational circuit that computes the equation Z=2*X-3, where X...
Q.1.It is required to design an iterative combinational circuit that computes the equation Z=2*X-3, where X is an n-bit signed number in 2’s complement representation. (Hint: -3 can be represented as -1+-1+-1 in 2’s complement representation, where -1 is represented as 111…..111). a)Determine the number of inputs and outputs needed for your 1-bit cell. Explain the meaning of values in the interface signals. b)Derive the truth table of your 1-bit cell. c) Derive minimized equations for your 1-bit using K-Map...
Microprocessor 8086 material. Choose the correct answer. 1- For a (64K x 8) RAM, the number...
Microprocessor 8086 material. Choose the correct answer. 1- For a (64K x 8) RAM, the number of address lines is: * 17 19 16 15 20 14 18 2-Which of the following instructions requires (BYTE PTR)? * SHR [500H], 3h LDS SI, [1000H] LAHF PUSH [9AAH] ADD AX, [800H] 3-Where are the interrupt vectors located in the microprocessor’s memory? * in the first 64K byte in the first 1K byte in the first 256K byte in the first 1M byte...