Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,393,592 papers from all fields of science
Search
Sign In
Create Free Account
Logic optimization
Logic optimization, a part of logic synthesis in electronics, is the process of finding an equivalent representation of the specified logic circuit…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Binary decision diagram
Boolean algebra
Circuit minimization for Boolean functions
Combinational logic
Expand
Broader (2)
Digital electronics
Electronic engineering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Low Complexity Design of Ripple Carry and Brent–Kung Adders in QCA
Vikramkumar Pudi
,
K. Sridharan
IEEE transactions on nanotechnology
2012
Corpus ID: 27958548
The design of adders on quantum dot cellular automata (QCA) has been of recent interest. While few designs exist, investigations…
Expand
Highly Cited
2010
Highly Cited
2010
A New Combinational Logic Minimization Technique with Applications to Cryptology
J. Boyar
,
R. Peralta
The Sea
2010
Corpus ID: 13473493
A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the…
Expand
Highly Cited
2010
Highly Cited
2010
Design of AES S-box using combinational logic optimization
Nabihah Ahmad
,
Rezaul Hasan
,
W. M. Jubadi
IEEE Symposium on Industrial Electronics and…
2010
Corpus ID: 14073387
Advanced Encryption Standard (AES) is one of the most common symmetric encryption algorithms. The hardware complexity in AES is…
Expand
2008
2008
Resonant-Clock Latch-Based Design
V. Sathe
,
J. Kao
,
M. Papaefthymiou
IEEE Journal of Solid-State Circuits
2008
Corpus ID: 10721371
This paper describes RF1 and RF2, two level-clocked test-chips that deploy resonant clocking to reduce power consumption in their…
Expand
Review
2002
Review
2002
Logic, Optimization, and Constraint Programming
J. Hooker
INFORMS journal on computing
2002
Corpus ID: 11872710
Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has…
Expand
2002
2002
Congestion minimization during placement without estimation
Bo Hu
,
M. Marek-Sadowska
International Conference on Computer Aided Design
2002
Corpus ID: 5689668
This paper presents a new congestion minimization technique for standard cell global placement. The most distinct feature of this…
Expand
Highly Cited
1994
Highly Cited
1994
Multi-level Logic Optimization By Implication Analysis
W. Kunz
,
P. R. Menon
IEEE/ACM International Conference on Computer…
1994
Corpus ID: 10301386
This paper proposes a new approach to multi-level logic optimization based on ATPG (Automatic Test Pattern Generation). Previous…
Expand
Highly Cited
1993
Highly Cited
1993
Algorithms for Approximate FSM Traversal
Hyunwoo Cho
,
G. Hachtel
,
E. Macii
,
B. Plessier
,
F. Somenzi
30th ACM/IEEE Design Automation Conference
1993
Corpus ID: 6214703
In this paper we present algorithms for approximate FSM traversal based on state space decomposition. The original FSM is…
Expand
Highly Cited
1993
Highly Cited
1993
Sequential logic optimization by redundancy addition and removal
L. Entrena
,
K. Cheng
International Conference on Computer Aided Design
1993
Corpus ID: 7756073
This paper presents a method of multi-level logic optimization for combinational and synchronous sequential logic. The circuits…
Expand
Highly Cited
1992
Highly Cited
1992
Synthesis of robust delay-fault-testable circuits: theory
S. Devadas
,
K. Keutzer
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1992
Corpus ID: 6913149
The authors give a comprehensive theoretical framework for the analysis and synthesis of delay-fault-testable combinational logic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE