(a) a = 54, b = 45, c = 43, d = 21
(b) a = 93, b = 59, c = 55, d = 73
Assume an unsigned binary representation. Determine:
(a) the subexpressions required for each column;
(b) the unique product expressions;
(c) y1, y2, y3, and y4 in binary format where the bit positions represent the presence or absence of the product expressions. Apply the iterative matching algorithm to y1, y2, y3, and y4 Calculate the total number of shifts and adds required to realize T after subexpression elimination has been applied. How many shifts and additions have been saved compared to a realization of T that uses no sharing?