Design an SPP that implements the following algorithm. Your design must use the least possible number...

 

Transcribed Image Text:

Design an SPP that implements the following algorithm. Your design must use the least possible number of states. Your solution should consist of the processor's FSMD, its datapath and the state diagram of the controller. int i, j; int A[5], B[5], C[9]; while (1) { while (!go_i); A[0] A0_in; A[1] A1_in; A[2] = A2_in; A[3] = A3_in; A[4] = A4_in; B[0] = B0_in; B[1] B1_in; B[2] = 82_in; = = B[3] = 83_in; B[4] = 84_in; for (i=0; i <9; i++) { C[i]=0; for (i-0; i <5; i++) { for (j0; j <5; j++) { } C[i+j]+= A[i]*B[4-j]; Design an SPP that implements the following algorithm. Your design must use the least possible number of states. Your solution should consist of the processor's FSMD, its datapath and the state diagram of the controller. int i, j; int A[5], B[5], C[9]; while (1) { while (!go_i); A[0] A0_in; A[1] A1_in; A[2] = A2_in; A[3] = A3_in; A[4] = A4_in; B[0] = B0_in; B[1] B1_in; B[2] = 82_in; = = B[3] = 83_in; B[4] = 84_in; for (i=0; i <9; i++) { C[i]=0; for (i-0; i <5; i++) { for (j0; j <5; j++) { } C[i+j]+= A[i]*B[4-j];