用可逆逻辑设计了一种带carry选择的稀疏树加法器

2016 International Conference On Communication Problem-Solving (ICCP) Pub Date : 2016-09-01 DOI:10.1109/ICCPS.2016.7751107

Wang Renping, Zhuang Tingting, Jiang Hao

{"title":"用可逆逻辑设计了一种带carry选择的稀疏树加法器","authors":"Wang Renping, Zhuang Tingting, Jiang Hao","doi":"10.1109/ICCPS.2016.7751107","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a 32-bit improved adder combined with sparse tree by radix-2 and carry select. We designed its models-point operation, carry-out, 4-bit ripple-carry adder and 4-bit selector by reversible logic, and designed with smic0.18um process corresponding MOS circuit to achieve. The simulation results could verify that the algorithm and the design by reversible logic are right.","PeriodicalId":348961,"journal":{"name":"2016 International Conference On Communication Problem-Solving (ICCP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A sparse tree adder with carry-select designed by reversible logic\",\"authors\":\"Wang Renping, Zhuang Tingting, Jiang Hao\",\"doi\":\"10.1109/ICCPS.2016.7751107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed a 32-bit improved adder combined with sparse tree by radix-2 and carry select. We designed its models-point operation, carry-out, 4-bit ripple-carry adder and 4-bit selector by reversible logic, and designed with smic0.18um process corresponding MOS circuit to achieve. The simulation results could verify that the algorithm and the design by reversible logic are right.\",\"PeriodicalId\":348961,\"journal\":{\"name\":\"2016 International Conference On Communication Problem-Solving (ICCP)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference On Communication Problem-Solving (ICCP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCPS.2016.7751107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference On Communication Problem-Solving (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPS.2016.7751107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种结合基数-2稀疏树和进位选择的32位改进加法器。采用可逆逻辑设计了其模型——点运算、执行、4位纹波进位加法器和4位选择器，并设计了与smic0.18um工艺相对应的MOS电路来实现。仿真结果验证了算法和可逆逻辑设计的正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A sparse tree adder with carry-select designed by reversible logic

In this paper, we proposed a 32-bit improved adder combined with sparse tree by radix-2 and carry select. We designed its models-point operation, carry-out, 4-bit ripple-carry adder and 4-bit selector by reversible logic, and designed with smic0.18um process corresponding MOS circuit to achieve. The simulation results could verify that the algorithm and the design by reversible logic are right.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference On Communication Problem-Solving (ICCP)

自引率

0.00%

发文量