{"title":"准布斯乘数","authors":"L. Dadda, V. Piuri, F. Salice","doi":"10.1109/ICISS.1996.552409","DOIUrl":null,"url":null,"abstract":"A new approach to number representation is presented to implement fast parallel multipliers: the operands are given in a signed-digit representation, similar to the one proposed by Booth. With respect to a multiplier based on the Booth's notation, our approach allows one to save circuit complexity and, as a consequence, silicon area (up to 20% for the partial product generator).","PeriodicalId":131620,"journal":{"name":"1996 Proceedings. Eighth Annual IEEE International Conference on Innovative Systems in Silicon","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The quasi-Booth multiplier\",\"authors\":\"L. Dadda, V. Piuri, F. Salice\",\"doi\":\"10.1109/ICISS.1996.552409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach to number representation is presented to implement fast parallel multipliers: the operands are given in a signed-digit representation, similar to the one proposed by Booth. With respect to a multiplier based on the Booth's notation, our approach allows one to save circuit complexity and, as a consequence, silicon area (up to 20% for the partial product generator).\",\"PeriodicalId\":131620,\"journal\":{\"name\":\"1996 Proceedings. Eighth Annual IEEE International Conference on Innovative Systems in Silicon\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1996 Proceedings. Eighth Annual IEEE International Conference on Innovative Systems in Silicon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISS.1996.552409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1996 Proceedings. Eighth Annual IEEE International Conference on Innovative Systems in Silicon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISS.1996.552409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new approach to number representation is presented to implement fast parallel multipliers: the operands are given in a signed-digit representation, similar to the one proposed by Booth. With respect to a multiplier based on the Booth's notation, our approach allows one to save circuit complexity and, as a consequence, silicon area (up to 20% for the partial product generator).