2007 International Conference on Electrical Engineering 2007
DOI: 10.1109/icee.2007.4287307
|View full text |Cite
|
Sign up to set email alerts
|

Logic Optimization for Majority Gate-Based Nanoelectronic Circuits Based on Genetic Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(21 citation statements)
references
References 6 publications
0
21
0
Order By: Relevance
“…In the second iteration, by removing duplicated inputs in node [3], substituting [3] with [4], and deleting nodes that contain no majority gates, the network becomes f=M(b, [4]', [4]). In the third iteration, this circuit is finally optimized as given in (14).…”
Section: ) [4]=m(0ac')mentioning
confidence: 99%
See 1 more Smart Citation
“…In the second iteration, by removing duplicated inputs in node [3], substituting [3] with [4], and deleting nodes that contain no majority gates, the network becomes f=M(b, [4]', [4]). In the third iteration, this circuit is finally optimized as given in (14).…”
Section: ) [4]=m(0ac')mentioning
confidence: 99%
“…However, these functions are limited to synthesizing three-variable functions. Other approaches that can handle majority logic circuits with more than three variables are proposed in [14][15][16][17][18]. In these methods, standard logic synthesis tools, such as SIS [19], are initially used to decompose the circuit into three-feasible networks.…”
Section: Introductionmentioning
confidence: 99%
“…The main logic gates AND and OR can be performed utilizing the QCA universal gate (majority gate) by setting one of the inputs to 0 and 1 respectively. Majority gate is dominant in the QCA world with several studies focusing on it such as [23][24][25][26][27]. Two configurations of the majority gate are introduced in QCA as illustrated in Figure 3 [28].…”
Section: Introductionmentioning
confidence: 99%
“…The various algorithms differ mainly in how the initial circuit is preprocessed and decomposed and in how nodes are translated into majority expressions. The algorithms have been further extended [24] to consider technology-aware cost metrics [25], [26] or to consider four inputs in the decomposed nodes [27] and have been optimized using genetic algorithms [28], [29].…”
Section: Introductionmentioning
confidence: 99%