Boolean algebra
1,407 resources related to Boolean algebra
IEEE Organizations related to Boolean algebra
Back to TopConferences related to Boolean algebra
Back to Top2013 16th International Conference on Information Fusion  (FUSION 2013)
Scope of the conference is to provide medium to discuss advances and applications of fusion methodologies. Conference will include contributions in the areas of fusion methodologies, theory and representation, algorithms and modelling and simulation.
2012 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL 2012)
The NEUREL conferences have been organized as a biennial events to allow scientists, experts, and engineers working in diverse areas to report their recent research in the field of neural networks and fuzzy systems, and to contribute to their applications, mainly, but not only, in electrical engineering.
2012 5th International Workshop on Soft Computing Applications (SOFA)
After four successful editions, the 5th IEEE SOFA is moving to Szeged  Hungary, where it aims to gather as many Soft Computing (SC) researchers and professionals as possible. The main goal of the Workshop is to communicate and publish new theoretical and applicative research results, in the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, and other methods belonging or connected to SC. A second and just as important goal is to encourage new reflections on SC issues and new links between interested researchers, R&D engineers, managers, etc.
2012 IEEE International Conference on Granular Computing (GrC2012)
IEEE GrC 2012 will continue to address the issues related to Granular Computing and its applications. IEEE GrC 2012 will provide researchers from universities, laboratories and industry to present stateoftheart research results and methodologies in theory and applications of granular computing. The conference will also make it possible for researchers and developers to highlight their new research directions and new interactions with novel computing models. To broaden more impact on granular computing and its applications, IEEE GrC 2012 will focus on currently important major research tracks such as soft computing (fuzzy, rough sets and etc), social network, cloud computing, eintelligence (web intelligence, semantic web), bioinformatics and medical informatics.
2011 9th IEEE International Conference on Control and Automation (ICCA)
IEEE ICCA 2001 aims to create a forum for scientists and practicing engineers throughout the world to present the latest research findings and ideas in the areas of control and automation.
More Conferences
Periodicals related to Boolean algebra
Back to TopCircuits and Systems II: Express Briefs, IEEE Transactions on
Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.
Computational Biology and Bioinformatics, IEEE/ACM Transactions on
Specific topics of interest include, but are not limited to, sequence analysis, comparison and alignment methods; motif, gene and signal recognition; molecular evolution; phylogenetics and phylogenomics; determination or prediction of the structure of RNA and Protein in two and three dimensions; DNA twisting and folding; gene expression and gene regulatory networks; deduction of metabolic pathways; microarray design and analysis; proteomics; ...
Computers, IEEE Transactions on
Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...
Xplore Articles related to Boolean algebra
Back to TopAn Axiomatic Interpretation of Interval Generalized Incidence Calculus
Qiu Ji; Qingxiang Wu; Xi Huang 2006 International Conference on Machine Learning and Cybernetics, 2006
An interval generalized incidence calculus theory (IGICT) has been proposed. In this paper, we give an axiomatization of IGICT. After introducing a new definition of possible world, we prove that the interval generalized incidence calculus constructed by axioms is equivalent to the one constructed by possible worlds. We then show that the lower and upper incidence functions can be used ...
An extension of the Kraft inequality (Corresp.)
R. Banerji IEEE Transactions on Information Theory, 1964
First Page of the Article ![](/xploreAssets/images/absImages/01053696.png)
On setvalued functions and Boolean collections
R. Tosic; D. A. Simovici; I. Stojmenovic; C. Reischer [1992] Proceedings The TwentySecond International Symposium on MultipleValued Logic, 1992
The notion of a Boolean collection of set is introduced, and several combinatorial aspects of these collections are exploited. These collections of set appear to play a role in the approximation of nonBoolean setvalued functions by Boolean functions and, therefore, are relevant in the study of biocircuits and in the study of circuits based on frequency multiplexing, where setvalued functions ...
The Ordering of Terms in Cutbased Recursive Disjoint Products
J. A. Buzacott IEEE Transactions on Reliability, 1983
In the disjoint products version of the cutbased method of reliability analysis of graphs it is necessary to determine the order in which the cuts are to be considered. The usual approach has been to order them in terms of the number of arcs in the cut, with the cuts with the least number of arcs considered first. However, the ...
Conditioning of events and related topics
S. Weber [1992 Proceedings] IEEE International Conference on Fuzzy Systems, 1992
The author presents a lattice ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying unconditional events are Boolean or fuzzy, respectively. The structure of a lattice with an additional semigroup operation interpreted as an intersection is considered. An additional axiom (MV), transforming that type of lattice into a MValgebra, makes possible the ...
More Xplore Articles
Educational Resources on Boolean algebra
Back to TopeLearning
An Axiomatic Interpretation of Interval Generalized Incidence Calculus
Qiu Ji; Qingxiang Wu; Xi Huang 2006 International Conference on Machine Learning and Cybernetics, 2006
An interval generalized incidence calculus theory (IGICT) has been proposed. In this paper, we give an axiomatization of IGICT. After introducing a new definition of possible world, we prove that the interval generalized incidence calculus constructed by axioms is equivalent to the one constructed by possible worlds. We then show that the lower and upper incidence functions can be used ...
An extension of the Kraft inequality (Corresp.)
R. Banerji IEEE Transactions on Information Theory, 1964
First Page of the Article ![](/xploreAssets/images/absImages/01053696.png)
On setvalued functions and Boolean collections
R. Tosic; D. A. Simovici; I. Stojmenovic; C. Reischer [1992] Proceedings The TwentySecond International Symposium on MultipleValued Logic, 1992
The notion of a Boolean collection of set is introduced, and several combinatorial aspects of these collections are exploited. These collections of set appear to play a role in the approximation of nonBoolean setvalued functions by Boolean functions and, therefore, are relevant in the study of biocircuits and in the study of circuits based on frequency multiplexing, where setvalued functions ...
The Ordering of Terms in Cutbased Recursive Disjoint Products
J. A. Buzacott IEEE Transactions on Reliability, 1983
In the disjoint products version of the cutbased method of reliability analysis of graphs it is necessary to determine the order in which the cuts are to be considered. The usual approach has been to order them in terms of the number of arcs in the cut, with the cuts with the least number of arcs considered first. However, the ...
Conditioning of events and related topics
S. Weber [1992 Proceedings] IEEE International Conference on Fuzzy Systems, 1992
The author presents a lattice ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying unconditional events are Boolean or fuzzy, respectively. The structure of a lattice with an additional semigroup operation interpreted as an intersection is considered. An additional axiom (MV), transforming that type of lattice into a MValgebra, makes possible the ...
More eLearning Resources
IEEEUSA EBooks

Appendix A: Counting in Base 2
This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

Designing Asynchronous Circuits using NULL Convention Logic (NCL) begins with an introduction to asynchronous (clockless) logic in general, and then focuses on delayinsensitive asynchronous logic design using the NCL paradigm. The book details design of inputcomplete and observable dualrail and quadrail combinational circuits, and then discusses implementation of sequential circuits, which require datapath feedback. Next, throughput optimization techniques are presented, including pipelining, embedding registration, early completion, and NULL cycle reduction. Subsequently, lowpower design techniques, such as wavefront steering and MultiThreshold CMOS (MTCMOS) for NCL, are discussed. The book culminates with a comprehensive design example of an optimized Greatest Common Divisor circuit. Readers should have prior knowledge of basic logic design concepts, such as Boolean algebra and Karnaugh maps. After studying this book, readers should have a good understanding of the differences between asynchronous and synchronous circuits, and should be able to design arbitrary NCL circuits, optimized for area, throughput, and power. Table of Contents: Introduction to Asynchronous Logic / Overview of NULL Convention Logic (NCL) / Combinational NCL Circuit Design / Sequential NCL Circuit Design / NCL Throughput Optimization / LowPower NCL Design / Comprehensive NCL Design Example

Appendix C: Summary of Boolean Functions
This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

Boolean Algebra Applied to Logic Circuits
This chapter contains sections titled: Boolean AlgebraÂ Â Definitions and Postulates Boolean Expressions Truth Tables and Theorems Relating Logic Expressions to Logic Circuits Using Boolean Algebra to Manipulate Logic Circuits NAND and NORGates Duality of Functions Positive and Negative Logic ExclusiveORGates Multivalued Logic Overview and Summary Sources Problems

Switching theory is concerned with the development of models and techniques for the analysis and synthesis of those circuits in which information is represented in discrete or digital form, as opposed to the analog form in which information is represented in a continuous manner. The application of digital techniques over a wider range of human activities has already profoundly affected modern life, and there is no visible limit to their future utility.This book is the outgrowth of a course on switching circuits that the author has taught since 1960, and it is designed as a text to provide a unified treatment of the subject with particular emphasis on sequential circuit theory. An attempt has been made to include only those techniques that have been generally accepted and seem to have lasting application.The first four of the nine chapters are devoted to basic principles and to combinational circuit theory. They introduce number systems, binary codes, Boolean algebra, switching functions, the analysis and synthesis of combinational gate circuits (including NAND, NOR, EXCLUSIVEOR, and EXCLUSIVENOR), and threshold logic, among other topics. Also covered are algebraic, geometric, and tabular techniques for the minimization of algebraic expressions.The remainder of this book is on sequential circuit theory. A general treatment is emphasized by classification of the sequentialcircuit operation as either fundamental mode or pulse mode, and as either clocked or not clocked. A comparison of the two modes is enhanced by design examples in which the same problem specifications are used for each mode. Both algebraic and tablular techniques are presented for the analysis and synthesis of these circuits. The timely topics of control states and register transfers in sequential desi gn are included. The book closes with a discussion of sequentialcircuit minimization associated with the reduction of flow tables, and the stateassignment problem.Answers are provided to selected problems.

This chapter contains sections titled: Introduction to Digital Circuits Binary Numbers: a Quick Introduction Boolean Algebra Minterms: Standard or Canonical Sum of Products (SOP) Form Maxterms: Standard or Canonical Product of Sums (POS) Form Karnaugh Maps and Design Examples Product of Sums Simplifications Don't Care Conditions Logic Gates: Electrical and Timing Characteristics Summary Further Reading Problems

The prelims comprise: Digital Electronics and Engineering Abstract Mathematics and Algebras History of Symbolic Logic and Boolean Algebra Mathematical Logic Number Systems and General Mathematics History of Computers Syllogistic Reasoning

This chapter contains sections titled: AND and NOT Grouping with Parentheses AND and OR with More Than Two Inputs Algebraic Examples of ArbitraryInput AND and OR Functions Truth Tables for ArbitraryInput AND and OR Functions Creating ArbitraryInput AND and OR Gates from the Old TwoInput Kind An ArbitraryInput AND Gate An ArbitraryInput OR Gate

This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.