2022
DOI: 10.1109/tcad.2022.3149720
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Power Optimization Approach for Fixed Polarity Reed–Muller Logic Circuits Based on Metaheuristic Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 37 publications
0
11
0
Order By: Relevance
“…Search for the smallest element in the distance matrix, set as b i,y (9) E sωd � E sωd + b i,y (10) Replace i and y input probabilities with b i,y (11) Calculate a new distance matrix A (y−1)(y−1) (12) end while (13) x 0 Example 4. Suppose that 0 polarity f 0 (x 4 , x 3 , x 2 , x 1 ) � ⊙􏽑 (0, 4, 5, 7, 9, 12, 15), fnd the mixed polarity XNOR/OR expression with polarity 25.…”
Section: Parallel Polarity Conversion Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…Search for the smallest element in the distance matrix, set as b i,y (9) E sωd � E sωd + b i,y (10) Replace i and y input probabilities with b i,y (11) Calculate a new distance matrix A (y−1)(y−1) (12) end while (13) x 0 Example 4. Suppose that 0 polarity f 0 (x 4 , x 3 , x 2 , x 1 ) � ⊙􏽑 (0, 4, 5, 7, 9, 12, 15), fnd the mixed polarity XNOR/OR expression with polarity 25.…”
Section: Parallel Polarity Conversion Algorithmmentioning
confidence: 99%
“…end if (7) for all new list lines do (8) if the new list line is the same as the original list line then (9) Delete the new list line and the original list line (10) else (11) Add the new list line to the original list line (12) end if (13) end for (14) if r j �� 1, p j �� 2||r j �� 2, p j �� 1 then (15) Te…”
Section: Global Exploration Optimizermentioning
confidence: 99%
See 3 more Smart Citations