Challenge - Pipelined Polynomial Evaluation

The module computes y = ((c3*x + c2)*x + c1)*x + c0 with signed 12-bit inputs and a signed 32-bit output.

Challenge objective

• keep the same interface;
• use Horner's form;
• produce o_valid='1' and the correct result in at most 3 cycles;
• improve the starter code latency, which evaluates the steps too slowly;
• i_reset='1' clears internal state.