Chan-Ho Park, Byun-Soo Choi, Dong-Ik Lee, Ho-Yong Choi
{"title":"非对称并行阵列结构的异步阵列乘法器","authors":"Chan-Ho Park, Byun-Soo Choi, Dong-Ik Lee, Ho-Yong Choi","doi":"10.1109/ARVLSI.2001.915561","DOIUrl":null,"url":null,"abstract":"In this paper an asynchronous array multiplier with a new parallel structure is introduced. This parallel array structure is designed to make the computation time faster with lower power consumption. An asymmetric array structure is used to minimize the average computation time in an asynchronous multiplier. Simulation shows that this structure reduces the time needed for computation by 55% as compared to conventional Booth encoding array structures and that the multiplier with the proposed array structure shows reduction of 40% in the computational time with relatively lower power consumption.","PeriodicalId":424368,"journal":{"name":"Proceedings 2001 Conference on Advanced Research in VLSI. ARVLSI 2001","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Asynchronous array multiplier with an asymmetric parallel array structure\",\"authors\":\"Chan-Ho Park, Byun-Soo Choi, Dong-Ik Lee, Ho-Yong Choi\",\"doi\":\"10.1109/ARVLSI.2001.915561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an asynchronous array multiplier with a new parallel structure is introduced. This parallel array structure is designed to make the computation time faster with lower power consumption. An asymmetric array structure is used to minimize the average computation time in an asynchronous multiplier. Simulation shows that this structure reduces the time needed for computation by 55% as compared to conventional Booth encoding array structures and that the multiplier with the proposed array structure shows reduction of 40% in the computational time with relatively lower power consumption.\",\"PeriodicalId\":424368,\"journal\":{\"name\":\"Proceedings 2001 Conference on Advanced Research in VLSI. ARVLSI 2001\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 Conference on Advanced Research in VLSI. ARVLSI 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARVLSI.2001.915561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 Conference on Advanced Research in VLSI. ARVLSI 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARVLSI.2001.915561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Asynchronous array multiplier with an asymmetric parallel array structure
In this paper an asynchronous array multiplier with a new parallel structure is introduced. This parallel array structure is designed to make the computation time faster with lower power consumption. An asymmetric array structure is used to minimize the average computation time in an asynchronous multiplier. Simulation shows that this structure reduces the time needed for computation by 55% as compared to conventional Booth encoding array structures and that the multiplier with the proposed array structure shows reduction of 40% in the computational time with relatively lower power consumption.