Exercise 9.5. Arithmetic operators (2) Half of the assignments below are illegal; find them and explain why. (Hint: See table 9.4.) a) slv Outp'length=[1082(N*m*x +1)]. (5) y=x" (constant exponent, all non-negative integers) -> Outp'length=[1082(xmax"+1)|| (6) Outp' length = minimum(L'length, R'length) for rem; Outp'length = R' length for mod (7) Outp' length = Inp'length For unsigned and signed (ranges normalized to ".. downto 0"): (8) maximum(L'length, R'length)-1 downtoo (output length = largest input length) (9) UNS 'length-1 downto (output length = length of unsigned input) (10) SIG' length-1 downto a (output length = length of signed input) (11) L'length+R' length-1 downtoo (output length = sum of inputs' lengths) (12) 2. UNS' length-1 downtoo (output length = twice length of unsigned input) (13) 2. SIG' length-1 downto O (output length = twice length of signed input) (14) L'length-1 downtoo (output length = length of input on the left) (15) R' length-1 downtoo (output length = length of input on the right) For ufixed and sfixed: (16) maximum (L'left, R'left)+1 downto minimum(L'right, R'right) (17) FIX' left+1 downto minimum(@, FIX'right) (size based on UFIX or SFIX element) (18) L'left+R' left+1 downto L'right+R'right (19) 2.FIX' left+1 downto FIX'right (size based on UFIX or SFIX element) (continued) Table 9.4 (continued) (20) L'left-R'right downto L'right-R'left-1 (21) UFIX' left downto UFIX' right-UFIX'left-1 (NAT conv. to UFIXCUFIX' left downto 0)) (22) L'left-R'right+1 downto L'right-R'left (23) SFIX' left+1 downto SFIX'right-SFIX' left (INT conv. to SFIX(SFIX' left downto 0)) (24) minimum (L'left, R'left) downto minimum (L'right, R'right) (25) For mod SFIX: R'left downto minimum(L'right, R'right) (26) FIX' left downto minimum(O, FIX'right) (size based on UFIX or SFIX element) (27) arg'left+1 downto arg'right For float: (28) maximum (L'left, R'left) downto minimum (L'right, R'right) (29) FLO'range (range of float input) Notes: (1) Type real not included in the lists above; use float for synthesis. (2) For some types, compilers require just the total number of bits to be observed