Title :
Architectures for polynomial evaluation
Author :
Aravena, J.L. ; Soh, S.T.
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
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
Keywords :
computational complexity; parallel architectures; polynomials; computational complexity; parallel algorithms; polynomial; regular architecture; time complexity; Broadcasting; Computer architecture; Multiprocessor interconnection networks; Parallel algorithms; Polynomials; Processor scheduling; Scheduling algorithm;
Conference_Titel :
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location :
Tallahassee, FL
Print_ISBN :
0-8186-1933-3
DOI :
10.1109/SSST.1989.72459
