CMPE RSD Fall 2021 Homework 3

Due Oct 4

P1

Second Edition Book Problem 3.6. Optimize the SDF graph shown in Fig. 3.18 to a single C function implementing the schedule at compile-time, and by optimizing the FIFO queues into single variables.

P2

Second Edition Book Problem 3.7. Convert the SDF graph in Fig. 3.18 to a single-clock hardware implementation. Perform first a multi-rate expansion. You can assume that the snk actor is implemented as a system-level output port.

P3

Second Edition Book Problem 4.2. Draw the CFG and the DFG of the program in Listing 4.2. Include all control dependencies in the CFG. Include the data dependencies for the variables a and b in the DFG.

Listing 4.2 for Problem 4.2

int count(int a, int b){
    while (a<b)
        a = a * 2;
    return a + b;
}

P4

Second Edition Book Problem 4.3. Design a datapath in hardware for the program shown in Listing 4.3. Allocate registers and operators. Indicate control inputs by the data-path, and condition flags generated by the datapath.

Listing 4.3 for Problem 4.3:

unsigned char mysqrt( unsigned int N){
    unsigned int x,j;
    x= 0;
    for( j = 1<<7; j!= 0; j>>=1){
        x = x + j;
        if ( x*x > N)
            x = x - j;
    }
    return x;
}

P5

Second Edition Book Problem 5.7 Develop the state-machine requested using SystemVerilog. Present commented code, commented testbench code, and simulation results.

P6

Second Edition Book Problem 5.8 Develop the state-machine requested using SystemVerilog. Present commented code, commented testbench code, and simulation results.