<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Journal of Iranian Association of Electrical and Electronics Engineers</title>
<title_fa>نشریه مهندسی برق و الکترونیک ایران</title_fa>
<short_title>Journal of Iranian Association of Electrical and Electronics Engineers</short_title>
<subject>Engineering &amp; Technology</subject>
<web_url>http://jiaeee.com</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>2676-5810</journal_id_issn>
<journal_id_issn_online>2676-6086</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>10.61882/jiaeee</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>fa</language>
<pubdate>
	<type>jalali</type>
	<year>1389</year>
	<month>1</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2010</year>
	<month>4</month>
	<day>1</day>
</pubdate>
<volume>7</volume>
<number>2</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa>Design and Synthesis of High Speed Low Power
Signed Digit Adders</title_fa>
	<title>Design and Synthesis of High Speed Low Power Signed Digit Adders</title>
	<subject_fa>الکترونیک</subject_fa>
	<subject>Electronic</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa>&lt;p&gt;Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation&lt;br&gt;
is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the&lt;br&gt;
primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to&lt;br&gt;
{&amp;ndash;1, 0, 1}, and finally adding the transfers to the corresponding (i.e., with the same weight) interim sum digits. All the&lt;br&gt;
final sum digits are therefore obtained in parallel. The special case of radix-2h maximally redundant SD number systems&lt;br&gt;
is more attractive due to maximum symmetric range (i.e., [&amp;ndash;2h+1, 2h&amp;ndash;1]) with only one redundancy bit per SD, and the&lt;br&gt;
possibility of more efficient carry-free addition. The previous relevant works use three parallel adders that compute sum&lt;br&gt;
and sum&amp;plusmn;1, where some speed-up is gained at the cost of more area and power. In this paper, we propose an alternative&lt;br&gt;
nonspeculative addition scheme that uses carry-save encoding for representation of the primary sum and interim sum&lt;br&gt;
digits and computes the transfer digits via a fast combinational logic. The simulation and synthesis of the proposed&lt;br&gt;
adder, based on 0.13 &amp;mu;m CMOS technology, shows advantages in terms of speed, power and area.&lt;/p&gt;
</abstract_fa>
	<abstract>&lt;p style=&quot;text-align: justify;&quot;&gt;Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation&lt;br&gt;
is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the&lt;br&gt;
primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to&lt;br&gt;
{&amp;ndash;1, 0, 1}, and finally adding the transfers to the corresponding (i.e., with the same weight) interim sum digits. All the&lt;br&gt;
final sum digits are therefore obtained in parallel. The special case of radix-2h maximally redundant SD number systems&lt;br&gt;
is more attractive due to maximum symmetric range (i.e., [&amp;ndash;2h+1, 2h&amp;ndash;1]) with only one redundancy bit per SD, and the&lt;br&gt;
possibility of more efficient carry-free addition. The previous relevant works use three parallel adders that compute sum&lt;br&gt;
and sum&amp;plusmn;1, where some speed-up is gained at the cost of more area and power. In this paper, we propose an alternative&lt;br&gt;
nonspeculative addition scheme that uses carry-save encoding for representation of the primary sum and interim sum&lt;br&gt;
digits and computes the transfer digits via a fast combinational logic. The simulation and synthesis of the proposed&lt;br&gt;
adder, based on 0.13 &amp;mu;m CMOS technology, shows advantages in terms of speed, power and area.&lt;/p&gt;
</abstract>
	<keyword_fa>Computer arithmetic, Carry-free addition, Signed-digit number systems, Low power design, Maximal
redundancy.</keyword_fa>
	<keyword>Computer arithmetic, Carry-free addition, Signed-digit number systems, Low power design, Maximal
redundancy.</keyword>
	<start_page>0</start_page>
	<end_page>0</end_page>
	<web_url>http://jiaeee.com/browse.php?a_code=A-10-1-152&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Gh.</first_name>
	<middle_name></middle_name>
	<last_name> Jaberipur</last_name>
	<suffix></suffix>
	<first_name_fa>Gh.</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa> Jaberipur</last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>1003194753284600567</code>
	<orcid>1003194753284600567</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>S.</first_name>
	<middle_name></middle_name>
	<last_name> Gorgin</last_name>
	<suffix></suffix>
	<first_name_fa>S.</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa> Gorgin</last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>1003194753284600568</code>
	<orcid>1003194753284600568</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
