Below are sample codes for the Fibonacci project.
In all them, it is assumed that *input_s* is greater or equal to 1.

- fibo0.v: This version implements everytihng into a single clocked always statement with 3 states.
- fibo3.v: This version implements the design with one clocked always statement with 2 states and additional assign statements. This example is further depicted in the following slides.
- fibo5.v: This version implements all 32 Fibonacci numbers in combinational logic, which are then fed into a 32:1 multiplexor. i.e., the array reference "F(n)" effectively translates into a multiplexor with "n" as the selector. Given that "n" is a 5-bit number, "n" can only be in the range of 0…31.

For your RLE and SHA1 project, the coding style in these sample codes may serve as a starting point.