{"title":"一种新颖的乘三电路","authors":"C. Foster, E. Riseman, F. G. Stockton, C. Wogrin","doi":"10.1109/ARITH.1975.6156983","DOIUrl":null,"url":null,"abstract":"Recently, while considering the connection of a 48 bit word computer to a 16 bit computer, we felt the need for a fast and inexpensive device that would multiply a binary address by a factor of three. Since 3N = N + 2N, there is an obvious solution of providing a normal adder circuit and presenting one set of inputs with N and the other with N-shifted left one place. But, there is a great deal of redundancy here since knowing one input we have complete knowledge of the other.","PeriodicalId":360742,"journal":{"name":"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel multiply-by-three circuit\",\"authors\":\"C. Foster, E. Riseman, F. G. Stockton, C. Wogrin\",\"doi\":\"10.1109/ARITH.1975.6156983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, while considering the connection of a 48 bit word computer to a 16 bit computer, we felt the need for a fast and inexpensive device that would multiply a binary address by a factor of three. Since 3N = N + 2N, there is an obvious solution of providing a normal adder circuit and presenting one set of inputs with N and the other with N-shifted left one place. But, there is a great deal of redundancy here since knowing one input we have complete knowledge of the other.\",\"PeriodicalId\":360742,\"journal\":{\"name\":\"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1975.6156983\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1975.6156983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
最近，在考虑将48位字计算机连接到16位计算机时，我们觉得需要一种快速而廉价的设备，它可以将二进制地址乘以3倍。由于3N = N + 2N，有一个明显的解决方案是提供一个普通加法器电路，并提供一组输入N，另一组输入N左移一个位置。但是，这里有大量的冗余，因为知道一个输入，我们就完全知道另一个输入。
Recently, while considering the connection of a 48 bit word computer to a 16 bit computer, we felt the need for a fast and inexpensive device that would multiply a binary address by a factor of three. Since 3N = N + 2N, there is an obvious solution of providing a normal adder circuit and presenting one set of inputs with N and the other with N-shifted left one place. But, there is a great deal of redundancy here since knowing one input we have complete knowledge of the other.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
