{"title":"硬件和软件的等价:解决多项式函数的一个案例研究","authors":"Kuo-pao Yang, T. Beaubouef","doi":"10.1109/SSST.2010.5442817","DOIUrl":null,"url":null,"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.","PeriodicalId":6463,"journal":{"name":"2010 42nd Southeastern Symposium on System Theory (SSST)","volume":"21 1","pages":"318-322"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Equivalence of Hardware and Software: A case study for solving polynomial functions\",\"authors\":\"Kuo-pao Yang, T. Beaubouef\",\"doi\":\"10.1109/SSST.2010.5442817\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":6463,\"journal\":{\"name\":\"2010 42nd Southeastern Symposium on System Theory (SSST)\",\"volume\":\"21 1\",\"pages\":\"318-322\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 42nd Southeastern Symposium on System Theory (SSST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.2010.5442817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 42nd Southeastern Symposium on System Theory (SSST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.2010.5442817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Equivalence of Hardware and Software: A case study for solving polynomial functions
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.