Question

We want to make a design that calculates the maximum difference between any two numbers within an array, a, consisting of 256 8-bit values stored in a register file 256x8. The high-level C code for this design is provided below. Convert this to a High-level state machine. Inputs: byte a [256), bit go Outputs: byte max_diff, bit done MAX_DIFF: while(1) { while( !go); done = 0; i 0; max = 0; min 255; // largest 8-bit value while( i < 256 ) { if( ali] < min ) { min = a[i]; if( a[i] > max ) { max = a[i]; } i i + 1; } max_diff = max min; done 1; } }

Answer 1

Here i am providing the answer. Hope it helps. please give me a like. it helps me a lot.

Answer:-

The HLSM of the system is as shown in the Figure 1. Inputs: go (bit), a, b (256-byte memory) Outputs: done (bit), max_diff (8 bits) Local Registers: min, max, i (8 bits) go go i<256 a[i]<min D B done := '0' i = 0 max = 0 min = 255 E min = a[i] (a[i]<min) (i<256) F (a[i]>max) H H a[i]>max max_diff :-max-min done :='l' i:=i+1 max := a[i]

The HLSM can be designed using nine states and the required conditions as shown in the figure....A,B,C,D,E,F,G,H and I are the states and in state A it enters the while loop if go is asserted then it goes to the state B inner loop and done is loaded with 0, i is loaded with 0, max is loaded with 0,min is loaded with 255 and goes to state C inner while loop...If i>256 then max_diff is oloaded with max-min and done is loaded with 1 and it goes back to state A in terminating the execution and waits in state A till go is asserted else it enter the loop and goes to state D...

Thank you. please upvote.