Design a digital system that multiplies two unsigned binary numbers by the repeated addition method. For example, to multiply 5 by 4, it adds the multiplicand four times: 5 + 5+5+5= 20. Let the multiplicand be in register BR, the multiplier in register AR, and the product in register PR. Assume that the width of BR and AR is n bits and the width of PR is 2n bits. Assume that there are two input buses A and B for loading the multiplicand and multiplier respectively and also two inputs start and reset. Assume that there is a 2n bit output P which is connected to the output of the register PR. The start input is used to load the multiplier and multiplicand and start the multiplication process. (a) Draw the I/O block diagram of this multiplier clearly showing all the inputs and outputs. (b) Obtain the ASM chart for this system. (c) Design the datapath and control unit for this multiplier. Use one-hot encoding for the control unit design (one flip flop per state). Show all the essential design details. Assume that registers with parallel load, adders, comparators, counters and other similar digital building blocks are available. Show how reset input is used to force the system into initial state at any time. (d) What are the pros and cons of this multiplier compared with the multiplier that uses a modified shift and add algorithm discussed in the class?
Added by Steven H.
Close
Step 1
Step 1: Draw the I/O Block Diagram - Inputs: - Bus A (n bits) for multiplicand - Bus B (n bits) for multiplier - Start signal - Reset signal - Outputs: - Bus P (2n bits) for product - Registers: - BR (n bits) for multiplicand - AR (n bits) for Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 92 other Physics 102 Electricity and Magnetism educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Do a finite state machine that detects the sequence 101 on serial one-bit input x. One-bit output Z is 0 unless the 101 has been detected. Z should be one in any case in which the previous 3 inputs are 101, including overlapping cases. Reset = 1 should take the finite state machine back to the initial state. This is a block diagram of a generic FSM. Assume a Moore Model (Remember in a Moore model, states alone combinatorially determine output Z). If it takes 4 states to make this machine, then n = 2. And if you do {Q, x} m = 3. What to do: A) Draw a state diagram for this machine. B) Create a state assignment table for your state machine. C) Create a state transition table for your state machine. D) Find the logic to get Z from the state Q.
Patha S.
Adi S.
Recommended Textbooks
University Physics with Modern Physics
Physics: Principles with Applications
Fundamentals of Physics
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD