双基数制的平行加法

The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI:10.1109/JCSSE.2013.6567333

Wutthipat Chalermchatwichien, A. Surarerks

{"title":"双基数制的平行加法","authors":"Wutthipat Chalermchatwichien, A. Surarerks","doi":"10.1109/JCSSE.2013.6567333","DOIUrl":null,"url":null,"abstract":"Double base number system (DBNS) is an alternative number system besides the binary system. Its representation is similar to the radix number system together with two bases, usually be two and three. DBNS preserves the two important properties: redundancy and sparseness. The redundancy is the property accommodating with the parallelism. In this research, we are interested in parallel addition algorithm on DBNS. Our theoretical result shows that parallel addition in DBNS can be performed. An addition algorithm together with the proof of correctness is described in this paper. In generally, we study the generalization form of DBNS addition algorithms in any sizes.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel addition for double base number system\",\"authors\":\"Wutthipat Chalermchatwichien, A. Surarerks\",\"doi\":\"10.1109/JCSSE.2013.6567333\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Double base number system (DBNS) is an alternative number system besides the binary system. Its representation is similar to the radix number system together with two bases, usually be two and three. DBNS preserves the two important properties: redundancy and sparseness. The redundancy is the property accommodating with the parallelism. In this research, we are interested in parallel addition algorithm on DBNS. Our theoretical result shows that parallel addition in DBNS can be performed. An addition algorithm together with the proof of correctness is described in this paper. In generally, we study the generalization form of DBNS addition algorithms in any sizes.\",\"PeriodicalId\":199516,\"journal\":{\"name\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2013.6567333\",\"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 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

双基数制(DBNS)是二进制以外的另一种数字制。它的表示法类似于基数制加上两个基数，通常是二和三。DBNS保留了两个重要的属性:冗余和稀疏。冗余是与并行性相适应的属性。在本研究中，我们对DBNS上的并行加法算法感兴趣。理论结果表明，在DBNS中可以实现并行加法。本文给出了一种加法算法，并给出了其正确性证明。一般来说，我们研究了任意规模的DBNS加法算法的泛化形式。

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

查看原文本刊更多论文

Parallel addition for double base number system

Double base number system (DBNS) is an alternative number system besides the binary system. Its representation is similar to the radix number system together with two bases, usually be two and three. DBNS preserves the two important properties: redundancy and sparseness. The redundancy is the property accommodating with the parallelism. In this research, we are interested in parallel addition algorithm on DBNS. Our theoretical result shows that parallel addition in DBNS can be performed. An addition algorithm together with the proof of correctness is described in this paper. In generally, we study the generalization form of DBNS addition algorithms in any sizes.

求助全文

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

来源期刊

The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)

自引率

0.00%

发文量