Filters

16,272 Hits in 3.5 sec

### Computer-Aided Minimization Procedure for Boolean Functions

N.N. Biswas
1986 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency.  ...  For dense functions consisting of a large number of inter-connected cyclic SPI chains, the solution may not be exactly minimal, but near minimal.  ...  ., for many valuable discussions about the procedure in this paper.  ...

### Computer Aided Minimization Procedure for Boolean Functions

N.N. Biswas
1984 21st Design Automation Conference Proceedings
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency.  ...  For dense functions consisting of a large number of inter-connected cyclic SPI chains, the solution may not be exactly minimal, but near minimal.  ...  ., for many valuable discussions about the procedure in this paper.  ...

### Page 1951 of Mathematical Reviews Vol. 55, Issue 6 [page]

1978 Mathematical Reviews
The algorithm for the D-flip flop presented here could benefit in some way the computer-aided state assignment procedures. Thammavarapu R. N. Rao and Krishna M.  ...  Systems-Computers-Controls 4 (1973), no. 6, 48-56. Authors’ summary: “This paper proposes a method for realization of three-valued switching functions by networks of minimal ternary threshold gates.  ...

### Interactive Teaching of Elementary Digital Logic Design With WinLogiLab

C. Hacker, R. Sitte
2004 IEEE Transactions on Education
This paper presents an interactive computerized teaching suite developed for the design of combinatorial and sequential logic circuits.  ...  The combinatorial tutorials follow the initial design steps: from Boolean algebra, to truth tables, to minimization techniques, to production of the combinatorial circuit in a seamless way.  ...  The animated computer screen is ideal for conveying the required design and analysis procedures, while enabling students to better visualize the functioning of the FSM.  ...

### Page 1390 of Mathematical Reviews Vol. 51, Issue 4 [page]

1976 Mathematical Reviews
C. 9983 An algorithm for minimizing Boolean functions. J. Optimization Theory Appl. 16 (1975), 87-97. The author claims that the “Cranfield method” for minimizing a Boolean function f [H. G.  ...  He indicates a procedure for solving such systems of equations that is suitable for programming on a computer. He also considers an axiomatic approach to this procedure. A.  ...

### Page 699 of Mathematical Reviews Vol. 58, Issue 1 [page]

1979 Mathematical Reviews
The procedure for synthesis is illustrated by an example.” Majumdar, Manjusri 58 #4679 On minimization of a class of C. H. Boolean functions from their graphs. Bull. Calcutta Math.  ...  The minimization of logic functions, i.e., the search for minimum num- bers of terms and literals, is studied by means of Karnaugh maps, the Quine-McCluskey algorithm, Tison’s procedure (i.e., heuristic  ...

### A New Approach to Simplifying Boolean Functions

A. H. M. Ashfak Habib, Md. Abdus Salam, Zia Nadir, Hemen Goswami
2004 The Journal of Engineering Research
But no method is effective for the simplification of Boolean functions, if it involves more than six variables.  ...  There are many benefits to simplifying Boolean functions before they are implemented in hardware.  ...  ., 1974) are more suitable for computer aided minimization than manual minimization.  ...

### A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver

1991 International Joint Conference on Artificial Intelligence
This system is built on an efficient and logically com plete propositional constraint solver that has been successfully used for industrial applica tions in computer aided design.  ...  This paper presents a logically complete as sumption based truth maintenance system (ATMS) that is part of a complex blast fur nace computer aided piloting system [5].  ...  Acknowledgments The authors would like to thank Jean Paul Billon for many suggestions and good advice, Jerome Euzenat, Philippe Kirsch, Libero Maesano and Jean Marc Pugin from Bull Cediag for their help  ...

### Page 4880 of Mathematical Reviews Vol. 58, Issue 6 [page]

1979 Mathematical Reviews
The author describes a heuristic method of minimization of the disjunctive normal forms for partially defined Boolean functions. {For the entire collection see MR 57 #11974.} A. D.  ...  Author’s summary: “We describe a computer program which has a Boolean expression and a functionally complete set of switching functions as input data and as output data and which gives a description of  ...

### Page 375 of Mathematical Reviews Vol. 51, Issue 1 [page]

1976 Mathematical Reviews
In practice these matrices are too large to handle without the aid of a computer.  ...  Control and Computer Sci. 8 (1974), 72-77 (1975).} B. Dimitrov (Sofia) Manukjan, V. A.; Plotnikov, A. D. 2800 On the minimization of bisummary normal forms of Boolean functions.  ...

### Computational Aids for Determining the Minimal Form of a Truth Function

Ronald Prather
1960 Journal of the ACM
Computational Aids for Determining the Minimal a Truth Function* RONALD PRATHER San Jose State College, San Jose, California Abstract.  ...  Several computational aids are presented for the purpose of adapting this algorithm to the solution of large-scale problems on a digital computer.  ...

### Multi-level logic minimization using implicit don't cares

K.A. Bartlett, R.K. Brayton, G.D. Hachtel, R.M. Jacoby, C.R. Morrison, R.L. Rudell, A. Sangiovanni-Vincentelli, A. Wang
1988 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
We propose a procedure, ESPRESSO-MLD, to transform a given Boolean network into a prime, irredundant, and "R-minimal" form.  ...  This paper describes a new approach for the minimization of multilevel logic circuits. We define a multilevel representation of a block of combinational logic called a Boolean network.  ...  Gregory contributed valuable technical input as well as making GE's "SOCRATES" expert system available to us for testing.  ...

### A Method of Majority Logic Reduction for Quantum Cellular Automata

R. Zhang, K. Walus, W. Wang, G.A. Jullien
2004 IEEE transactions on nanotechnology
In this paper, a method for reducing the number of majority gates required for computing three-variable Boolean functions is developed to facilitate the conversion of sum-of-products expression into QCA  ...  Thirteen standard functions are introduced to represent all threevariable Boolean functions and the simplified majority expressions corresponding to these standard functions are presented.  ...  The authors would also like to thank the anonymous reviewers of this paper for their incisive comments.  ...

### Page 3926 of Mathematical Reviews Vol. 58, Issue 5 [page]

1979 Mathematical Reviews
function as solutions of a Boolean equation.  ...  Synthesis algorithms were computerized and used for com- puter-aided design of some networks performing parallel signal processing.” Keller, F.  ...

### Abstracts of Current Computer Literature

1970 IEEE transactions on computers
; Minimization; Extrema Minimization of Boolean Functions Using Implication Masks 7728 Reduction of a Test Dictionary for Digital Machines by Prime-Implicant Minimiza- tion Methods 7751 Minimal  ...  Determination and Classification of Prime Implicants of Switching Functions-see 7753. Minimization of Boolean Functions Using Implication Masks-see 7728.  ...
« Previous Showing results 1 — 15 out of 16,272 results