{"title":"求整数平方根的快速方法","authors":"Ken Lyons","doi":"10.1145/259965.259987","DOIUrl":null,"url":null,"abstract":"ABSTUCE 17u3 paper describes a fmt algorithm for obtaining the square root of an unsigned integer. Although the algorithm is not a new one, it is much fmter than the popular Newton’s method. The theo~ suppotiing the operation of the algorithm is qlaine~ along with a discussion of the hardware implementation in the Ham”s RTX2000 series processors. Included are examples and details of programming the RTX2000 to pe~orm the algon”thnr.","PeriodicalId":391657,"journal":{"name":"FORTH '90 and '91","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A fast method for finding an integer square root\",\"authors\":\"Ken Lyons\",\"doi\":\"10.1145/259965.259987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTUCE 17u3 paper describes a fmt algorithm for obtaining the square root of an unsigned integer. Although the algorithm is not a new one, it is much fmter than the popular Newton’s method. The theo~ suppotiing the operation of the algorithm is qlaine~ along with a discussion of the hardware implementation in the Ham”s RTX2000 series processors. Included are examples and details of programming the RTX2000 to pe~orm the algon”thnr.\",\"PeriodicalId\":391657,\"journal\":{\"name\":\"FORTH '90 and '91\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"FORTH '90 and '91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/259965.259987\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"FORTH '90 and '91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/259965.259987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ABSTUCE 17u3 paper describes a fmt algorithm for obtaining the square root of an unsigned integer. Although the algorithm is not a new one, it is much fmter than the popular Newton’s method. The theo~ suppotiing the operation of the algorithm is qlaine~ along with a discussion of the hardware implementation in the Ham”s RTX2000 series processors. Included are examples and details of programming the RTX2000 to pe~orm the algon”thnr.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
