2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN) 2013
DOI: 10.1109/ice-ccn.2013.6528581
|View full text |Cite
|
Sign up to set email alerts
|

VLSI implementation of fast addition using quaternary Signed Digit number system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Now studies on optical computing algorithms and techniques have been made much progress and the optical computing modes have shown remarkable advantages in meeting the requirements such as parallel, carry-free, and fast computing. According to the value of the radix, the signed-digit representation contains the subsets of MSD number [5], [8], [9], [10], [11], trinary [2], [3], [12], [13], quaternary [14], [15], [16] and negabinary signed-digit number [17], and so on. According to the steps of optical computing, the MSD additions are now usually classified in terms of the number of steps involved, i.e., three-step [5], [8], [9], [10], [11], twostep [12], [13], [14], [18], [19], [20] and one-step algorithms [17], [21], [22], [23], [24].…”
Section: Introductionmentioning
confidence: 99%
“…Now studies on optical computing algorithms and techniques have been made much progress and the optical computing modes have shown remarkable advantages in meeting the requirements such as parallel, carry-free, and fast computing. According to the value of the radix, the signed-digit representation contains the subsets of MSD number [5], [8], [9], [10], [11], trinary [2], [3], [12], [13], quaternary [14], [15], [16] and negabinary signed-digit number [17], and so on. According to the steps of optical computing, the MSD additions are now usually classified in terms of the number of steps involved, i.e., three-step [5], [8], [9], [10], [11], twostep [12], [13], [14], [18], [19], [20] and one-step algorithms [17], [21], [22], [23], [24].…”
Section: Introductionmentioning
confidence: 99%