Architectures for polynomial evaluation
J.L. Aravena, Sieteng Soh · 2003
A regular architecture is proposed for the evaluation of polynomials of arbitrary degree. Control of the execution is accomplished with cube-type instruction. The time complexity is derived. The basic design is easily adapted to a pipeline structure. The study also shows that the constraint of regularity may make faster algorithms unsuitable for certain implementations.>