Sara Ghafari, Morteza Mousazadeh, A. Khoei, A. Dadashi
{"title":"基于改进进位预合并和Han-Carlson树法的高速低面积高效流水线128位加法器","authors":"Sara Ghafari, Morteza Mousazadeh, A. Khoei, A. Dadashi","doi":"10.23919/MIXDES.2019.8787134","DOIUrl":null,"url":null,"abstract":"In this paper, a 128-bit pipeline Adder is presented, in the form of a syntactic Tree Adder by an introduction of a new modified Carry-Look-Ahead (CLA) that is merged inside the Tree adder. The difference between proposed modified Carry-Look-Ahead and conventional Carry-Look-Ahead is that in proposed design by increase in the number of Carry-Look-Ahead single-block input reduces the number of groups, subsequently raises the performance of conventional Carry-Look-Ahead. In order to add two 128-bit numbers, these modified Carry-Look-Ahead Adders are merged with Tree algorithm, that the results of it have a significant improvement in complexity and gates count (25%), compared to the existing methods. This makes a significant reduction in transistor count and area efficiently.","PeriodicalId":309822,"journal":{"name":"2019 MIXDES - 26th International Conference \"Mixed Design of Integrated Circuits and Systems\"","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A New High-speed and Low area Efficient Pipelined 128-bit Adder Based on Modified Carry Look-ahead Merging with Han-Carlson Tree Method\",\"authors\":\"Sara Ghafari, Morteza Mousazadeh, A. Khoei, A. Dadashi\",\"doi\":\"10.23919/MIXDES.2019.8787134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a 128-bit pipeline Adder is presented, in the form of a syntactic Tree Adder by an introduction of a new modified Carry-Look-Ahead (CLA) that is merged inside the Tree adder. The difference between proposed modified Carry-Look-Ahead and conventional Carry-Look-Ahead is that in proposed design by increase in the number of Carry-Look-Ahead single-block input reduces the number of groups, subsequently raises the performance of conventional Carry-Look-Ahead. In order to add two 128-bit numbers, these modified Carry-Look-Ahead Adders are merged with Tree algorithm, that the results of it have a significant improvement in complexity and gates count (25%), compared to the existing methods. This makes a significant reduction in transistor count and area efficiently.\",\"PeriodicalId\":309822,\"journal\":{\"name\":\"2019 MIXDES - 26th International Conference \\\"Mixed Design of Integrated Circuits and Systems\\\"\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 MIXDES - 26th International Conference \\\"Mixed Design of Integrated Circuits and Systems\\\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/MIXDES.2019.8787134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 MIXDES - 26th International Conference \"Mixed Design of Integrated Circuits and Systems\"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/MIXDES.2019.8787134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New High-speed and Low area Efficient Pipelined 128-bit Adder Based on Modified Carry Look-ahead Merging with Han-Carlson Tree Method
In this paper, a 128-bit pipeline Adder is presented, in the form of a syntactic Tree Adder by an introduction of a new modified Carry-Look-Ahead (CLA) that is merged inside the Tree adder. The difference between proposed modified Carry-Look-Ahead and conventional Carry-Look-Ahead is that in proposed design by increase in the number of Carry-Look-Ahead single-block input reduces the number of groups, subsequently raises the performance of conventional Carry-Look-Ahead. In order to add two 128-bit numbers, these modified Carry-Look-Ahead Adders are merged with Tree algorithm, that the results of it have a significant improvement in complexity and gates count (25%), compared to the existing methods. This makes a significant reduction in transistor count and area efficiently.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
