{"title":"符号乘法器的新设计","authors":"R. Mudassir, H. El-Razouk, Z. Abid","doi":"10.1109/NEWCAS.2005.1496746","DOIUrl":null,"url":null,"abstract":"Two new architectures for signed multiplication for array and tree topologies are presented. The signed array multiplier is based on the new low power high speed adders, and achieves 15% and 30% reduction in time-delay and power consumption compared to Baugh Wooley's. The proposed tree multiplier incorporates two new low-power (4:2) compressors, capable of handling negative weights, and achieves 10% and 19% reduction in time-delay and power consumption compared to Wallace multiplier.","PeriodicalId":131387,"journal":{"name":"The 3rd International IEEE-NEWCAS Conference, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"New designs of signed multipliers\",\"authors\":\"R. Mudassir, H. El-Razouk, Z. Abid\",\"doi\":\"10.1109/NEWCAS.2005.1496746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two new architectures for signed multiplication for array and tree topologies are presented. The signed array multiplier is based on the new low power high speed adders, and achieves 15% and 30% reduction in time-delay and power consumption compared to Baugh Wooley's. The proposed tree multiplier incorporates two new low-power (4:2) compressors, capable of handling negative weights, and achieves 10% and 19% reduction in time-delay and power consumption compared to Wallace multiplier.\",\"PeriodicalId\":131387,\"journal\":{\"name\":\"The 3rd International IEEE-NEWCAS Conference, 2005.\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 3rd International IEEE-NEWCAS Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NEWCAS.2005.1496746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 3rd International IEEE-NEWCAS Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS.2005.1496746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Two new architectures for signed multiplication for array and tree topologies are presented. The signed array multiplier is based on the new low power high speed adders, and achieves 15% and 30% reduction in time-delay and power consumption compared to Baugh Wooley's. The proposed tree multiplier incorporates two new low-power (4:2) compressors, capable of handling negative weights, and achieves 10% and 19% reduction in time-delay and power consumption compared to Wallace multiplier.