{"title":"模(2n+1)算术逻辑","authors":"D. Agrawal, T. Rao","doi":"10.1109/ARITH.1978.6155764","DOIUrl":null,"url":null,"abstract":"A novel format for representing modulo (2n+1) numbers, is shown to be helpful in achieving modular addition and complementation. Logic for fast addition using carry-look-ahead and modular complementation is also presented.","PeriodicalId":443215,"journal":{"name":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On modulo (2n+1) arithmetic logic\",\"authors\":\"D. Agrawal, T. Rao\",\"doi\":\"10.1109/ARITH.1978.6155764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel format for representing modulo (2n+1) numbers, is shown to be helpful in achieving modular addition and complementation. Logic for fast addition using carry-look-ahead and modular complementation is also presented.\",\"PeriodicalId\":443215,\"journal\":{\"name\":\"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1978.6155764\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1978 IEEE 4th Symposium onomputer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1978.6155764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel format for representing modulo (2n+1) numbers, is shown to be helpful in achieving modular addition and complementation. Logic for fast addition using carry-look-ahead and modular complementation is also presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
