{"title":"简单的根除法和平方根,省略了一些加法步骤","authors":"P. Montuschi, L. Ciminiera","doi":"10.1109/ARITH.1991.145560","DOIUrl":null,"url":null,"abstract":"The authors present a novel algorithm for shared radix 2 division and square root whose main characteristic is the ability to avoid any addition when the digit 0 has been selected. The solution presented uses a redundant representation of the partial remainder, while keeping the advantages of classical solutions. It is shown how the next digit of the result can be selected even when the remainder is not updated; the tradeoff arising is also indicated. The average occurrences of 0 digit selections are also estimated in order to assess the benefits of the algorithm presented.<<ETX>>","PeriodicalId":190650,"journal":{"name":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","volume":"55 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Simple radix 2 division and square root with skipping of some addition steps\",\"authors\":\"P. Montuschi, L. Ciminiera\",\"doi\":\"10.1109/ARITH.1991.145560\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a novel algorithm for shared radix 2 division and square root whose main characteristic is the ability to avoid any addition when the digit 0 has been selected. The solution presented uses a redundant representation of the partial remainder, while keeping the advantages of classical solutions. It is shown how the next digit of the result can be selected even when the remainder is not updated; the tradeoff arising is also indicated. The average occurrences of 0 digit selections are also estimated in order to assess the benefits of the algorithm presented.<<ETX>>\",\"PeriodicalId\":190650,\"journal\":{\"name\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"volume\":\"55 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1991.145560\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1991.145560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simple radix 2 division and square root with skipping of some addition steps
The authors present a novel algorithm for shared radix 2 division and square root whose main characteristic is the ability to avoid any addition when the digit 0 has been selected. The solution presented uses a redundant representation of the partial remainder, while keeping the advantages of classical solutions. It is shown how the next digit of the result can be selected even when the remainder is not updated; the tradeoff arising is also indicated. The average occurrences of 0 digit selections are also estimated in order to assess the benefits of the algorithm presented.<>