Devise a pipeline architecture that can perform the computation described in Exercise 9.1 using all the available parallelism. Assume a new input vector arrives and a result can be accepted on every clock cycle.
Exercise 9.1
In computer graphics applications, a three-dimensional vector representing a point's position in space can be transformed by multiplying by a 3 × 3 matrix:
Determine the data dependencies in the computation and thus the maximum available parallelism.