1995
DOI: 10.1049/el:19950334
|View full text |Cite
|
Sign up to set email alerts
|

Look-ahead circuit for CSD-code carry determination

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…There are several studies [4,5,6] treating CSD recoding from 2's complement binary number representation. In order to recode an SD number to the corresponding CSD form according to those theories, the SD number must be converted to 2's complement binary number as the fast step, and then to the CSD form.…”
Section: Introductionmentioning
confidence: 99%
“…There are several studies [4,5,6] treating CSD recoding from 2's complement binary number representation. In order to recode an SD number to the corresponding CSD form according to those theories, the SD number must be converted to 2's complement binary number as the fast step, and then to the CSD form.…”
Section: Introductionmentioning
confidence: 99%
“…Traditional binary-to-CSD converter is designed recursively with a carry propagation adder, which is slow and energy-inefficient [4]. In order to improve the speed, a look-ahead method is adopted to the binary-to-CSD converter [5,6], which trades off higher speed with more energy consumption and inefficient VLSI implementations. To take advantage of the property that there's no adjacent nonzero digits existed in the CSD coding, a bypass signal is used in the converter to boost its performance with less area overhead [7].…”
Section: Introductionmentioning
confidence: 99%
“…Conventional approaches [1], [6], [7] to the binary to CSD transformation use an intermediate binary carry…”
mentioning
confidence: 99%