{"title":"新的数字递归除法算法","authors":"Jo Ebergen, Ivan Sutherland, Ajanta Chakraborty","doi":"10.1109/ACSSC.2004.1399485","DOIUrl":null,"url":null,"abstract":"This paper offers two new division algorithms by digit recurrence. Compared to the standard radix-2 division algorithms with carry-save addition, the new division algorithms trade off a simpler selection logic for more alternatives in the basic repetition step. Our final division algorithm is potentially faster and more energy efficient than radix-2 division with carry-save addition, because the selection logic has less delay and the repetition steps on average perform fewer additions and subtractions.","PeriodicalId":396779,"journal":{"name":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"New division algorithms by digit recurrence\",\"authors\":\"Jo Ebergen, Ivan Sutherland, Ajanta Chakraborty\",\"doi\":\"10.1109/ACSSC.2004.1399485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper offers two new division algorithms by digit recurrence. Compared to the standard radix-2 division algorithms with carry-save addition, the new division algorithms trade off a simpler selection logic for more alternatives in the basic repetition step. Our final division algorithm is potentially faster and more energy efficient than radix-2 division with carry-save addition, because the selection logic has less delay and the repetition steps on average perform fewer additions and subtractions.\",\"PeriodicalId\":396779,\"journal\":{\"name\":\"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2004.1399485\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2004.1399485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper offers two new division algorithms by digit recurrence. Compared to the standard radix-2 division algorithms with carry-save addition, the new division algorithms trade off a simpler selection logic for more alternatives in the basic repetition step. Our final division algorithm is potentially faster and more energy efficient than radix-2 division with carry-save addition, because the selection logic has less delay and the repetition steps on average perform fewer additions and subtractions.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
