2016 IEEE International Conference on Recent Trends in Electronics, Information &Amp; Communication Technology (RTEICT) 2016
DOI: 10.1109/rteict.2016.7807782
|View full text |Cite
|
Sign up to set email alerts
|

Design and implementation of 4-bit ripple carry adder using SETMOS architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
0
1
0
1
Order By: Relevance
“…The critical path delay is determined by the longest pathway through the adder circuit. Therefore, the critical path delay of N-bit adders is determined by three gate delays of the first bit adder and to ripples in two gate delays of each of the next adders [1], explaining why it is called 'ripple carry adder (RCA)' [2], [3]. The critical path delay is calculated using (1).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The critical path delay is determined by the longest pathway through the adder circuit. Therefore, the critical path delay of N-bit adders is determined by three gate delays of the first bit adder and to ripples in two gate delays of each of the next adders [1], explaining why it is called 'ripple carry adder (RCA)' [2], [3]. The critical path delay is calculated using (1).…”
Section: Introductionmentioning
confidence: 99%
“…(2) declares how the path delay requires multi-bit OR-AND gates to achieve the correct carry-out value.𝐢 π‘œπ‘’π‘‘ = 𝑔7 + 𝑝 7 𝑔 6 + 𝑝 7 𝑝 6 𝑔 5 + 𝑝 7 𝑝 6 𝑝 5 𝑔 4 + 𝑝 7 𝑝 6 𝑝 5 𝑝 4 𝑔 3 + 𝑝 7 𝑝 6 𝑝 5 𝑝 4 𝑝 3 𝑔 2 + 𝑝 7 𝑝 6 𝑝 5 𝑝 4 𝑝 3 𝑝 2 𝑔 1 + 𝑝 7 𝑝 6 𝑝 5 𝑝 4 𝑝 3 𝑝 2 𝑝 1 𝑔 0 + 𝑝 7 𝑝 6 𝑝 5 𝑝 4 𝑝 3 𝑝 2 𝑝 1 𝑝 0 𝐢 0…”
unclassified