2021
DOI: 10.1049/cds2.12083
|View full text |Cite
|
Sign up to set email alerts
|

A new coplanar design of a 4‐bit ripple carry adder based on quantum‐dot cellular automata technology

Abstract: Quantum-dot cellular automata (QCA) is one of the best methods to implement digital circuits at nanoscale. It has excellent potential with high density, fast switching speed, and low energy consumption. Researchers have emphasized reducing the number of gates, the delay, and the cell count in QCA technology. In addition, a ripple carry adder (RCA) is a circuit in which each full adder's carry-out is the connection for the next full adder's carry-in. These types of adders are quite simple and easily expandable … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(12 citation statements)
references
References 42 publications
0
12
0
Order By: Relevance
“…The second implementation of the adder uses 209 cells with an area of 0.25 µm 2 with the same latency. Saeid Seyedi et al [22] have designed a nano-scale RCA in order to minimize the cell number and delay thereby improving the complexity of the circuit. The proposed co-planar design uses 89 cells in 0.12 µm 2 but giving a delay of 3.75 clock cycles which results in an increase in the quantum cost.…”
Section: Qca Basic Conceptsmentioning
confidence: 99%
“…The second implementation of the adder uses 209 cells with an area of 0.25 µm 2 with the same latency. Saeid Seyedi et al [22] have designed a nano-scale RCA in order to minimize the cell number and delay thereby improving the complexity of the circuit. The proposed co-planar design uses 89 cells in 0.12 µm 2 but giving a delay of 3.75 clock cycles which results in an increase in the quantum cost.…”
Section: Qca Basic Conceptsmentioning
confidence: 99%
“…Furthermore, to measure the proposed full-adder complexity, we used the QCA cost function. The cost function is expressed as follows 39,40 :…”
Section: Comparisonsmentioning
confidence: 99%
“…Also, k, l, p are the weights for majority gate, crossover, and delay, respectively. 39,40 In this part, different values (between 1 and 4) are considered for these weights to compare them better. As shown in Table 5, the proposed full-adder has enhanced performance than its counterparts in terms of cost.…”
Section: Comparisonsmentioning
confidence: 99%
“…Furthermore, in order to apply the suggested fault-tolerant 1:2 demultiplexer complexity, we practiced its QCA cost function. The cost function can be calculated as follows [38,39]:…”
Section: Cell Defect Analysismentioning
confidence: 99%