Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,830 papers from all fields of science
Search
Sign In
Create Free Account
Combinational logic
Known as:
Combinatorial circuit
, Combinational
, Combinatorial logic (electronics)
Expand
In digital circuit theory, combinational logic (sometimes also referred to as time-independent logic) is a type of digital logic which is implemented…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
Arithmetic logic unit
Asynchronous circuit
Binary decoder
Boolean algebra
Expand
Broader (2)
Digital electronics
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
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
2006
Highly Cited
2006
Gate sizing to radiation harden combinational logic
Quming Zhou
,
K. Mohanram
IEEE Transactions on Computer-Aided Design of…
2006
Corpus ID: 7069979
A gate-level radiation hardening technique for cost-effective reduction of the soft error failure rate in combinational logic…
Expand
Highly Cited
2003
Highly Cited
2003
A transformation based algorithm for reversible logic synthesis
D. M. Miller
,
D. Maslov
,
G. Dueck
Proceedings - Design Automation Conference
2003
Corpus ID: 322347
A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are…
Expand
Highly Cited
1992
Highly Cited
1992
Test pattern generation using Boolean satisfiability
T. Larrabee
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1992
Corpus ID: 206439496
The author describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational…
Expand
Highly Cited
1992
Highly Cited
1992
Estimation of average switching activity in combinational and sequential circuits
Abhijit Ghosh
,
S. Devadas
,
K. Keutzer
,
Jacob K. White
[] Proceedings 29th ACM/IEEE Design Automation…
1992
Corpus ID: 15922770
The authors address the problem of estimating the average power dissipated in VLSI combinational and sequential circuits, under…
Expand
Highly Cited
1988
Highly Cited
1988
SOCRATES: a highly efficient automatic test pattern generation system
M. Schulz
,
E. Trischler
,
Thomas M. Sarfert
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1988
Corpus ID: 45168214
An automatic test pattern generation system, SOCRATES, is presented. SOCRATES includes several novel concepts and techniques that…
Expand
Review
1987
Review
1987
MIS: A Multiple-Level Logic Optimization System
R. Brayton
,
R. Rudell
,
A. Sangiovanni-Vincentelli
,
Albert R. Wang
IEEE Transactions on Computer-Aided Design of…
1987
Corpus ID: 18340064
MIS is both an interactive and a batch-oriented multilevel logic synthesis and minimization system. MIS starts from the…
Expand
Highly Cited
1983
Highly Cited
1983
On the Acceleration of Test Generation Algorithms
H. Fujiwara
,
T. Shimono
IEEE transactions on computers
1983
Corpus ID: 9547677
In order to accelerate an algorithm for test generation, it is necessary to reduce the number of backtracks in the algorithm and…
Expand
Highly Cited
1981
Highly Cited
1981
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
P. Goel
IEEE transactions on computers
1981
Corpus ID: 6691609
The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement error…
Expand
Highly Cited
1977
Highly Cited
1977
A logic design structure for LSI testability
E. Eichelberger
,
T. Williams
Design Automation Conference
1977
Corpus ID: 2381583
The ability to put hundreds of logic gates on a single chip of silicon offers great potential for reducing power, increasing…
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
or Only Accept Required