Y = x0h0 + x1h1 + x2h2 ………. x9h9
Compute Y in one clock cycle.
Compute Y keeping in mind that no two different arithmetic operations will take place in same clock edge.
Compute Y assuming you have TWO multipliers and ONE adder
Compute Y assuming there is no Multiplier module is available. You should not replace multiplier by shifted addition or repetitive additions. You can use memory. Consider the values of h0,…, h9 are known beforehand.
Compute Y assuming there is no multiplier module and no memory are available. Consider the values of h0,…, h9 are known beforehand. You should not replace multiplier by shifted addition or repetitive additions.
Get Free Quote!
366 Experts Online