Organization of computer systems: the fixed plus variable structure computer
IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
On the Parallel Evaluation of Polynomials
IEEE Transactions on Computers
A Universal Arithmetic Building Element (ABE) and Design Methods for Arithmetic Processors
IEEE Transactions on Computers
Optimal algorithms for parallel polynomial evaluation
Journal of Computer and System Sciences
Key management systems for sensor networks in the context of the Internet of Things
Computers and Electrical Engineering
Square-rich fixed point polynomial evaluation on FPGAs
Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays
| Hi-index | 0.01 |
Polynomials are generally evaluated by use of Horner's rule, sometimes referred to as the nesting rule. This rule is sequential and affords no opportunity for parallecl omputation, i.e., completion of several of the arithmetic operations simultaneously. Two generalizations of Horner's rule which allow for parallel computation are presented here. Schedules and, in some cases, machine codes for evaluating a polynomial on a computer with several parallel arithmetic units are developed. Some advantages of the generalized rules in sequential computations on a computer with a single arithmetic unit are presented.