DocumentCode
2019069
Title
Equivalence of Hardware and Software: A case study for solving polynomial functions
Author
Yang, Kuo-pao ; Beaubouef, Theresa
Author_Institution
Comput. Sci. & Ind. Technol. Dept., Southeastern Louisiana Univ., Hammond, LA, USA
fYear
2010
fDate
7-9 March 2010
Firstpage
318
Lastpage
322
Abstract
Newton´s Method for finding roots of polynomials is investigated as a case study in demonstrating the Principle of Equivalence of Hardware and Software. Implementations of this procedure in C++ code and in hardware on a field programmable gate array (FPGA) are presented. The similarities and differences in the two approaches are discussed.
Keywords
C++ language; Newton method; field programmable gate arrays; mathematics computing; polynomials; C++ code; Newton method; field programmable gate array; hardware equivalence; polynomial functions; polynomial roots; software equivalence; Application software; Application specific integrated circuits; Field programmable gate arrays; Hardware; Microprocessors; Newton method; Polynomials; Programmable logic arrays; Software algorithms; Software performance; Algorithms; FPGA; Hardware; Newton´s Method;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory (SSST), 2010 42nd Southeastern Symposium on
Conference_Location
Tyler, TX
ISSN
0094-2898
Print_ISBN
978-1-4244-5690-1
Type
conf
DOI
10.1109/SSST.2010.5442817
Filename
5442817
Link To Document