Question

Design a circuit that computes F = 4.5A (4.5 times A) using a full adder. Input...

Design a circuit that computes F = 4.5A (4.5 times A) using a full adder. Input A is a 4-bit number (A3A2A1A0) and A is an even number. A3 is the MSB.

Engineering   Electrical-Engineering   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Logical Table :

Input Output
Number A3 A2 A1 A0 Number F5 F4 F3 F2 F1 F0
0 0 0 0 0 0 0 0 0 0 0 0
2 0 0 1 0 9 0 0 1 0 0 1
4 0 1 0 0 18 0 1 0 0 1 0
6 0 1 1 0 27 0 1 1 0 1 1
8 1 0 0 0 36 1 0 0 1 0 0
10 1 0 1 0 45 1 0 1 1 0 1
12 1 1 0 0 54 1 1 0 1 1 0
14 1 1 1 0 63 1 1 1 1 1 1

K-map Solution:

F5 = A3

F4 = A2

F3 = A1

F2 = A3

F1 = A2

F0 = A1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Q1)Design a 3-bit full adder by using a 8x3 Decoder., Q2)Design a digital circuit by using...
Q1)Design a 3-bit full adder by using a 8x3 Decoder., Q2)Design a digital circuit by using a 8x1 multiplexer implementing the following Boolean equation.F(A, B, C, D) =∑(2, 3, 5, 7, 8, 9, 12, 13, 14, 15)
Use contraction beginning with a 4-bit adder-subtractor with carry in, to design a 4-bit circuit without...
Use contraction beginning with a 4-bit adder-subtractor with carry in, to design a 4-bit circuit without carry out that increments its input by 0010 for input S=0 and decrements its input by 0010 for input S=1. Perform the design by designing the distinct 1-bit full adder cells needed and indicating the type of cell used in each of the four bit positions.
Design Half-adder and Full-adder circuits using truth tables. Use only 2-input NAND gates
Design Half-adder and Full-adder circuits using truth tables. Use only 2-input NAND gates
Design a 4-bit adder-subtractor circuit using the 4-bit binary Full adders (74LS83) and any necessary additional...
Design a 4-bit adder-subtractor circuit using the 4-bit binary Full adders (74LS83) and any necessary additional logic gates. The circuit has a mode input bit, M, that controls its operation. Specifically, when M=0, the circuit becomes a 4-bit adder, and when M=1, the circuit becomes a 4-bit subtractor that performs the operation A plus the 2’s complement of B.Where A and B are two 4-bits binary numbers. That is, * When M=0, we perform A+B, and we assume that both...
Design a Single cell 1 bit Carry propagate (or Ripple Carry Adder) full adder. a. Generate...
Design a Single cell 1 bit Carry propagate (or Ripple Carry Adder) full adder. a. Generate the truth table b. Using K-map or Boolean algebra, determine the logical expression for Carry out (C-out) and Sum (S) Outputs C. Draw the circuit diagram of the outputs in step b
Design a 1-bit Full adder using one 3-bit majority encoder and a set of NAND gates
Design a 1-bit Full adder using one 3-bit majority encoder and a set of NAND gates
Design a full 4-bit adder. Include analysis, explanation and simulation (can be in multisim, proteus or...
Design a full 4-bit adder. Include analysis, explanation and simulation (can be in multisim, proteus or liviwire).
What might be the purpose of using a full adder (rather than a half adder) for...
What might be the purpose of using a full adder (rather than a half adder) for the first "column" in a parallel adder circuit?
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...
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT