Hardware vs. software implementations for calculating roots of polynomials

Authors:
Kuo-pao Yang;Theresa Beaubouef
Affiliations:
Southeastern Louisiana University, Hammond, LA;Southeastern Louisiana University, Hammond, LA
Venue:
Journal of Computing Sciences in Colleges
Year:
2010

Citing 6
Cited 0

An FPGA implementation and performance evaluation of the Serpent block cipher

FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
Automated target recognition on SPLASH 2

FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
A Reliable LZ Data Compressor on Reconfigurable Coprocessors

FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
An adaptive Reed-Solomon errors-and-erasures decoder

Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays
The Essentials of Computer Organization And Architecture

The Essentials of Computer Organization And Architecture
A field programmable gate array media player for realmedia files

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses ongoing research into the design and development of custom configurable hardware using a field programmable gate array. In particular, Newton's Method for finding roots of polynomials is investigated, and the solutions using both software and hardware techniques are presented and compared. The Principle of Equivalence of Hardware and Software for this method is verified.