Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
minterms
Description:
Boolean logic terms that represent exactly one input combination for which a Boolean function evaluates to true.
Primary topic:
VLSI and FPGA Design Techniques (28%)
Related topics:
VLSI and FPGA Design Techniques (28%),
Coding theory and cryptography (9%)
OpenAlex ID:
keywords/minterms
A Theory of Galois Switching Functions
1978
·
Pradhan
·
IEEE Transactions on Computers
·
61
Polynomial-time algorithms for generation of prime implicants
1992
·
Tadeusz Strzemecki
·
Journal of Complexity
·
49
PDF
All-Optical Canonical Logic Units-Based Programmable Logic Array (CLUs-PLA) Using Semiconductor Optical Amplifiers
2012
·
Lei Lei
, Jianji Dong
, et al.
·
Journal of Lightwave Technology
·
38
Unateness Properties of and-Exclusive-or Logic Circuits
1974
·
L.T. Fisher
·
IEEE Transactions on Computers
·
34
Symmetrically recoded quaternary signed-digit arithmetic using a shared content-addressable memory
1996
·
Mohammad S. Alam
, Yugesh Ahuja
, et al.
·
Optical Engineering
·
29
Mathemtical model of composite objects and its application for organizing engineering databases
1988
·
M.A. Ketabchi
, V. Berzins
·
IEEE Transactions on Software Engineering
·
25
On Evaluating Boolean Functions With Unreliable Tests
1990
·
CLAIRE KENYON
, ANDREW C. YAO
·
International Journal of Foundations of Computer Science
·
23
Minimization of Switching Functions—A Fast Technique
1975
·
Sureshchander
·
IEEE Transactions on Computers
·
22
Highly efficient exhaustive search algorithm for optimizing canonical Reed-Muller expansions of boolean functions
1994
·
J. F. MILLER
, P. THOMSON
·
International Journal of Electronics
·
21
Bounds on the Number of Threshold Functions
1966
·
David R. Smith
·
IEEE Transactions on Electronic Computers
·
19
A Reduction Technique for Obtaining a Simplified Reliability Expression
1977
·
Thomas Case
·
IEEE Transactions on Reliability
·
16
Mapping of fixed polarity Reed-Muller coefficients from minterms and the minimization of fixed polarity Reed-Muller expressions
1997
·
MD. MOZAMMEL HUQ AZAD KHAN
, MD. SHAMSUL ALAM
·
International Journal of Electronics
·
15
A novel paired Haar based transform: algorithms and interpretations in Boolean domain
2002
·
B.J. Falkowski
, Chip-Hong Chang
·
IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)
·
14
A Fully Implicit Quine-McCluskey Procedure Using BDD’s
2020
·
Gitanjali Swamy
·
SSRN Electronic Journal
·
13
Importance factors of coherent systems: A review
2013
·
Yves Dutuit
, Antoine Rauzy
·
Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk and Reliability
·
13
An effective computer algorithm for the calculation of disjoint cube representation of Boolean functions
2002
·
B.J. Falkowski
, I. Schafer
, et al.
·
IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)
·
12
Determination of the irredundant forms of a Boolean function using Walsh-Hadamard analysis and dyadic groups
1978
·
Philipp W. Besslich
·
IEE Journal on Computers and Digital Techniques
·
12
On the construction of bent functions of $n+2$ variables from bent functions of $n$ variables
2008
·
Joan-Josep Climent
, Francisco J. García
, et al.
·
Advances in Mathematics of Communications
·
11
On Identification of Redundancy and Symmetry of Switching Functions
1971
·
S.S. Yau
, Y.S. Tang
·
IEEE Transactions on Computers
·
11
A Slide Rule Device for Checking 2-Summability
1968
·
P.K. Sinha Roy
·
IEEE Transactions on Computers
·
11
Test Generation From Bounded Algebraic Specifications Using Alloy
2011
·
Francisco Rebello de Andrade
, João Pascoal Faria
, et al.
·
International Conference on Software Technologies (ICSOFT)
·
10
Maximum independence and mutual information
2002
·
R. Meo
·
IEEE Transactions on Information Theory
·
10
Theoretical Aspects of Symbolic Automata
2017
·
Hellis Tamm
, Margus Veanes
·
Lecture notes in computer science
·
9
A Construction of Bent Functions of n + 2 Variables from a Bent Function of n Variables and Its Cyclic Shifts
2014
·
Joan-Josep Climent
, Francisco J. García
, et al.
·
Algebra
·
9
PDF
Set-Cover Heuristics for Two-Level Logic Minimization
2012
·
Ankit Kagliwal
, Shankar Balachandran
·
International Conference on VLSI Design
·
9
Show more works
View as search
Works count:
138
Citation count:
643
Year
Topic
Type