Complete Bi-Decomposition of Multiple-Valued Functions Using MIN and MAX Gates
|
|
- Lionel Mathews
- 6 years ago
- Views:
Transcription
1 Complete i-decomposition of Multiple-Valued Functions Using MIN and MX Gates ernd Steinbach TU ergakademie Freiberg Christian Lang IMMS ggmbh Erfurt bstract In this paper we apply the bi-decomposition on multivalued functions and restrict the decomposition to MIN and MX gates. It is known from [4] that the MIN and MX bi-decomposition leads in general to small multi-level circuits, well understandable for humans. Unfortunately, there does not exist a MIN or MX bi-decomposition for each multi-valued function. In this paper we close this gap by the MX-MIN multi-decomposition. Experimental results show that our complete decomposition of a set of benchmarks requires approximately the same sum of gates and literals as the known incomplete approach and the number of logic levels could even be reduced in average by 20 percent. 1. Introduction There are two very simple multi-valued gates having two or more inputs and one output. These gates are called MX gate and MIN gate. The output value of the MX (MIN) gate is equal to the maximal (minimal) value of the inputs. These simple gates allow sometimes a complete MX/MIN-bi-decomposition [4]. The decomposer I- DECOMP-MV was suggested by Mishchenko, Steinbach and Perkowski in [4]. This decomposer is based on E- MDDs [5] as central data structure and generates netlists of functions in multi-valued logic (MVL). The generated netlists have two valuable properties. First, the netlists are compact because the algorithm exploits external and internal don t cares. Second, the netlists are well-balanced, which reduces the delay of the resulting circuit. Unfortunately this approach cannot decompose all MVL functions completely. Experimental results have shown that only eleven of twenty six MVL functions of the POLO benchmarks could be decomposed completely using the MX- and the MIN-bi-decomposition [4]. complete bi-decomposition of MVL functions can be done by the YDE decomposer [2]. Lang implemented the decomposer YDE like a framework of tools for different types of decompositions, where the user can select the decomposition strategy. It may be difficult for the user to find good setups of the YDE decomposer because many different algorithms are implemented. Experimental results have shown that YDE finds better networks than the bi-decomposer I-DECOMP-MV on average. It should be mentioned that for all test cases, YDE found better minimizations of the test functions than MVSIS [1]. However, I-DECOMP- MV found better results for some test functions, which emphasizes the power of the simple MX/MIN-bi-decomposition. For that reason we suggest simple complete approach for decomposition of multiple-valued functions based on the MX/MIN-bi-decomposition in this paper. ecause of the restricted space, we omit all proofs of lemmas and theorems in this paper. The proofs are given in [2]. The remainder of this paper is organized as follows. Section 2 introduces multi-valued function intervals and further basic definitions. In Section 3 we summarize the theory of the MX/MIN-bi-decomposition of multiple-valued function intervals. The completeness of the decomposition will be ensured by the MX-MIN multi-decomposition, explained in Section 4. Section 5 gives experimental results. The paper concludes with a summary in Section Preliminaries In order to reach the required completeness of the decomposition we deal with multi-valued function intervals (MFIs) which generalize of MVL ISFs [3, 4]. There are multi-valued function sets (MFSs) that can be described by MFIs but not by MVL ISFs. Definition multi-valued function interval (MFI) F() = [f l, f u ] with f l () f u () is the set of MVL functions F() = { f() f l () f() f u () }. (1) The function f l () is the lower bound, and the function f u () is the upper bound of the MFI.
2 f 1 (a, b) b) F (a, b) 0 [0,1] [0,0] 1 [2,2] [1,2] 2 [1,1] [0,0] a) f 2 (a, b) f 3 (a, b) f 4 (a, b) Figure 1. Maps of a multi-valued function interval. a) Interval representation. b) Enumeration of the included multi-valued functions. n MFI F() = [f l, f u ] can be visualized by a map. For a minterm i, the bounds f l ( i ) and f u ( i ) are shown as an interval [f l ( i ), f u ( i )] in the field i of the map. Example Figure 1 shows the MFI F(a, b) = [f 1, f 4 ], the lower bound f l = f 1 and the upper bound f u = f 4. The function value of F (0, 0) can be chosen from the interval [0,1] and the value (2) is forbidden in this case. The care set C is equal to {(0, 1), (1, 0), (2, 0), (2, 1)}. The function value of F (1, 1) can be chosen from the interval [1,2] and the value (0) is forbidden in this case. The problems of decomposition can easily be described in terms of the min- and max-operators over variables. There are several possibilities to extend the oolean differential calculus (DC) to MVL functions. The definitions of the k-times minimum and the k-times maximum of a MVL function are given in [3]. For later use we define two more operators. Definition Let x and y be multi-valued variables, then leq 0 (x, y) = is the leq0-operator and geq m (x, y)) = is the geqm-operator. { 0, if x y x, otherwise { m, if x y x, otherwise (2) (3) 3. MX- and MIN-i-Decomposition 3.1. The Problem Given an MFI F(,, C) = [f l, f u ] the MX-bi-decomposition problem consists in finding pairs of functions g(, C), h(, C) that satisfy max ( g(, C), h(, C) ) f l (,, C) and (4a) max ( g(, C), h(, C) ) f u (,, C). (4b) The sets and are called the dedicated sets. The set C is called the common set. If there exists a pair g(, C), h(, C) that satisfies (4), the MFI F(,, C) is called MX-bi-decomposable. dditional terms must be defined to describe the relation between the functions g(, C) and h(, C) if there is more than one pair that satisfies (4). The free set is the set G(, C) of all functions g(, C) for which there exists at least one function h(, C) that satisfies (4). The bound set H g0 (, C) is the set of functions h(, C) so that the pair g 0 (, C), h(, C) satisfies (4). Similar terms can be defined for the MIN-bi-decomposition by replacing the max-operator with the min-operator MX-Decomposition Test test condition for the MX-decomposability of MFIs can be derived from the upper bounds of the decomposition functions as specified in the following theorem. Theorem 3.1 The MFI F(,, C) = [f l, f u ] is MX-decomposable with respect to the dedicated sets and iff where f l (,, C) max ( g u (, C), h u (, C) ), (5) g u (, C) = min k f u (,, C) h u (, C) = min k f u (,, C). (6a) (6b) Example Consider the MX-bi-decomposition of the MFI F(a, b) from Figure 1 repeated in Figure 2. The functions g u (a) and h u (b) calculated by (6a) and (6b) are shown to the left and at the bottom of Figure 2 respectively. Comparison with f l (a, b) = f 1 (a, b) in Figure 1 shows that (5) is satisfied. dditional comparison with f u (a, b) = f 4 (a, b) from Figure 1 reveals that g u (a), h u (b) is indeed a MXbi-decomposition of the MFI F (a, b) = [f l, f u ]. The equality max ( g u (a), h u (b) ) = f u (a, b) is a coincidence.
3 F (a, b) g(a) = gu (a) 0 [0,1] [0,0] 0 1 [2,2] [1,2] 2 2 [1,1] [0,0] h(b) = h u (b) F (a, b) g(a) = gl (a) 0 [0,0] [0,0] 0 1 [2,2] [0,2] 2 2 [1,1] [0,0] h(b) = h l (b) Figure 2. Map of a MX-bi-decomposition. Figure 3. Map of a MIN-bi-decomposition Computation of MX-Decomposition Functions To apply MX-bi-decomposition in decomposers, it is necessary to compute the free and bound sets. First, a formula for the free set is derived in Theorem 3.2. Then the bound set is computed in Theorem 3.3. Theorem 3.2 Let the MFI F(,, C) = [f l, f u ] be MX-decomposable with respect to the dedicated sets and. Then the free set of the MX-bi-decomposition of F(,, C) is the MFI G(, C) = [g l, g u ], where g l (, C) = max leq 0 fl (,, C), min k f u (,, C) ) (7) g u (, C) = min k f u (,, C). (8) Theorem 3.3 Let the MFI F(,, C) = [f l, f u ] be MXdecomposable with respect to the dedicated sets and, and let the function g 0 (, C) be a decomposition function of F(,, C). Then the bound set of the MX-bi-decomposition of F(,, C) with respect to the function g 0 (, C) is the MFI H g0 (, C) = [h l, h u ], where h l (, C) = max leq 0 fl (,, C), g 0 (, C) ) (9) h u (, C) = min k f u (,, C). (10) Each combination of a pair of functions from the MFIs G 1 (, C) = [g 1, g u ] and H 1 (, C) = [h 1, h u ] is a decomposition. The functions g u (, C) and h u (, C) are computed by (6), and h 1 (, C) is computed by (9). If the function g 1 (, C) is decreased to g 2 (, C) the upper bounds g u (, C) and h u (, C) do not change. However, the lower bound of H(, C) increases to h 2 (, C), i.e. the bound set becomes smaller. The smallest possible value for g(, C) with a nonempty bound set H(, C) is the function g l (, C) computed by (7). It is possible to exchange the sizes of the sets G(, C) and H(, C). Increasing the MFI G(, C) (so that it contains more functions), reduces the size of the MFI H(, C) and vice versa MIN-Decomposition MIN-bi-decomposition is dual to MX-bi-decomposition. The results for MX-bi-decomposition are adapted and summarized for the case of MIN-bi-decomposition. The cardinality of the MFI F (,, C) is denoted by m F. Theorem 3.4 The MFI F(,, C) = [f l, f u ] is MIN-decomposable with respect to the dedicated sets and iff where f u (,, C) min ( g l (, C), h l (, C) ), (11) g l (, C) = max k f l (,, C) h l (, C) = max k f l (,, C). (12a) (12b) Theorem 3.5 Let MFI F(,, C) = [f l, f u ] be MIN-decomposable with respect to the dedicated sets and. Then the free set of the MIN-bi-decomposition of F(,, C) is the MFI G(, C) = [g l, g u ], where g l (, C) = max k f l (,, C) (13) g u (, C) = min geq mf fu (,, C), max k f l (,, C) ). (14) Theorem 3.6 Let the MFI F(,, C) = [f l, f u ] be MINdecomposable with respect to the dedicated sets and, and let the function g 0 (, C) be a decomposition function of F(,, C). Then the bound set of the MIN-bi-decomposition of F(,, C) with respect to the function g 0 (, C) is the MFI H g0 (, C) = [h l, h u ], where h l (, C) = max k f l (,, C) (15) h u (, C) = min geq mf fu (,, C), g 0 (, C) ). (16) Example Figure 3 explains a MIN-bi-decomposition. The MFI F(, ) in Figure 3 is slightly changed in comparison to Figure 1. The restriction of F(0, 0) from [0,1] to [0,0] inhibits the MX-bi-decomposition. The extension of F(1, 1) from [0,1] to [0,2] allows the MIN bi-decomposition.
4 The functions g l (a) and h l (b) calculated by (12a) and (12b) are shown to the left and at the bottom of Figure 3 respectively. Comparison with f u (a, b) in Figure 3 shows that (11) is satisfied. The MIN operation of g(a) = g l (a) and h(b) = h l (b) is indeed a MIN-bi-decomposition of F(a, b) = [f l, f u ]. The equality min ( g l (a), h l (b) ) = f l (a, b) is a coincidence. 4. MX-MIN Multi-Decomposition There are MFIs that are not bi-decomposable with respect to MX and MIN gates. Weak bi-decomposition is applied to simplify non-bi-decomposable oolean functions. Unfortunately, there are MVL functions that are neither bi-decomposable nor weakly bi-decomposable [5]. For that reason new decomposition principles are necessary to ensure complete decomposition of all MVL functions. Several approaches to solve this problem are given in [2]. Multi-decomposition of a non bi-decomposable MFI with respect to MX and MIN gates ensures complete decomposition of all MVL functions. The MX-MIN multi-decomposition splits an MFI by a MX gate into n MIN-bi-decomposable MFIs, where the number n is minimized. In contrast to the bi-decomposition, the MFIs of the first level of a MX-MIN multi-decomposition do not depend on fewer variables in general. Definition MX-MIN multi-decomposition of an MFI F(,, C) with respect to the dedicated sets and is a vector of n functions so that f(,, C) = [f 1 (,, C),..., f n (,, C)] (17) max ( f 1 (,, C),..., f n (,, C) ) F(,, C), (18) where the functions f 1 (,, C),..., f n (,, C) are MIN-decomposable with respect to the dedicated sets and. To compute MX-MIN multi-decompositions, another criterion for MIN-decomposability of MFIs is developed in extension of Section 3.4. This criterion can be used to determine the minimum number of functions for MX-MIN multi-decomposition. MIN-decomposability of an MFI can be checked locally by considering all applicable triple of function values. Theorem 4.1 formulates a MIN-decomposition criterion based on this observation. Theorem 4.1 n MFI F(,, C) = [f l, f u ] is MIN-decomposable iff for all 5-tuples of minterms i, j, m, n, C k there is min ( f l ( i, m, C k ), f l ( j, n, C k ) ) f u ( i, n, C k ). (19) Properties of MX-MIN multi-decompositions can be shown with the help of an incompatibility graph, which is a graph with one node for each minterm and an edge between minterms for every pair of minterms that does not satisfy (19). Definition The MIN-incompatibility graph of the MFI F(,, C) with respect to the dedicated sets and is a graph with one node for each minterm ( i, m, C k ). There is an edge between all pairs of minterms ( i, m, C k ) and ( j, n, C k ) with min ( f l ( i, m, C k ), f l ( j, n, C k ) ) > f u ( i, n, C k ), (20) where F(,, C) = [f l, f u ]. Nodes with f l (,, C) = 0 can be omitted from the MIN-incompatibility graph because for these nodes (20) is never satisfied. Lemma 4.2 Let F(,, C) = [f l, f u ] be an MFI. Then F(,, C) is MIN-decomposable iff its MIN-incompatibility graph does not contain any edges. Lemma 4.2 shows that MX-MIN multi-decomposition problem is equivalent to partitioning the incompatibility graph of an MFI into subsets so that there are no edges between the nodes of the same subset. This is the graph coloring problem, which assigns a color to each node so that no pair of nodes with the same color is connected by an edge. Theorem 4.3 n MFI F(,, C) = [f l, f u ] is MX-MIN multi-decomposable into n functions iff its MIN-incompatibility graph is colorable with n colors. The number of subfunctions of a MX-MIN multi-decomposition can be computed from the number of colors that are necessary to color the MIN-incompatibility graphs of MFIs. Consider three minterms located in the same row a i of the map, say f l (a i, b m ), f l (a i, b n ) and f u (a i, b n ). Obviously, (19) is always satisfied for such a triple of function values because min(f l (a i, b m ), f l (a i, b n )) f l (a i, b n ) f u (a i, b n ) (21) follows from f l (a, b) f u (a, b). Therefore, a coloring of the incompatibility graph is to color each row with a different color. Similarly a coloring of the incompatibility graph is to color each column with a different color. It can be concluded that the number of colors necessary to color the incompatibility graph is bounded by the minimum numbers of rows and columns. Theorem 4.4 The MIN-incompatibility graph of a MFI F(,, C) = [f l, f u ] with respect to the dedicated sets and is colorable with n min ( M, M ) colors, where M and M are the numbers of different minterms of the variable sets and respectively.
5 F (a, b) 0 [0,0] [0,0] 1 [2,2] [1,2] 2 [1,1] [0,0] a) F 1 (a, b) g(a) 0 [0,0] [0,0] 0 1 [2,2] [0,2] 2 2 [1,1] [0,0] 1 c) 2 0 h(b) b) 1,0 1,1 2,0 F 2 (a, b) g(a) 0 [0,0] [0,0] 0 1 [0,2] [1,2] [1,2] 2 [0,1] [0,0] 0 Figure 4. Maps of a MX-MIN multi-decomposition. a) Given multi-valued function interval. b) Colored MIN-incompatibility graph. c) MIN decomposable multi-valued function intervals of the MX-MIN multi-decomposition. Example Figure 4 explains a MX-MIN multi-decomposition. s in Figure 3 the restriction of F(0, 0) from [0,1] to [0,0] inhibits the MX-bi-decomposition. The created MFI is not extended anywhere so that no MIN-bi-decomposition is possible. Figure 4 b) depicts the MIN-incompatibility graph of the MFI in Figure 4 a). The nodes (0,0), (0,1), and (2,1) are omitted because the lower bound values are equal to zero. s mentioned above there are no edges between nodes of the same row or column. There is an edge between the nodes (2,0) and (1,1) because (20) becomes true for f l (2, 0) = 1, f l (1, 1) = 1, and f u (2, 1) = 0 so that min(1, 1) > 0. The MIN-incompatibility graph can be colored using two colors. The first color is indicated in Figure 4 b) the by one circle and the second color by two circles around the colored node. ased on the two necessary colors two MIN decomposable MFIs are created. These MFI F 1 (a, b) and F 2 (a, b) are shown in Figure 4 c). The lower bounds are unchanged for the nodes of of the associated color and replaced by zero otherwise. The MFI F 1 (a, b) is MIN decomposable as shown in Figure 3. In this special case the MFI F 2 (a, b) includes two functions that does not depend on the variable b. 5. Experimental Results The MX- and MIN-bi-decomposition, the MX-MIN multi-decomposition and further decomposition methods are implemented in the configurable decomposer for multivalued functions sets, called YDE. ll details of YDE are described in [2]. Note, this new decomposer YDE is completely different to the previous version of YDE [3]. The results of the MX- and MIN-bi-decomposition for 26 benchmarks were published in [4]. These benchmarks are available from den Portland Logic Optimization Group (POLO) [6]. We repeat the main results of the decomposer I-DECOMP-MV (DM) [4] in the left part of Table 1. Eleven of these 26 multi-valued benchmark functions could be decomposed completely using the MX- and MIN-bidecomposition only. Decomposition of the other 15 benchmark functions results in a total of 2453 non decomposable MVL functions. For comparison we calculated the decompositions of exactly the same 26 benchmarks. Due to the MX-MIN multi-decomposition all benchmarks could decomposed completely using MX and MIN gates only. We used the predefined strategy SEPLL3 of YDE [2] (YDE3). In this strategy independend variable are eliminated. fter that MX- or MIN-bi-decompositions are executed and if no such decomposition exist, MX-MIN or MIN-MX multi-decomposition is applied. The experimental results are listed in right part of Table 1. The column enchmark gives the benchmark name. The number of inputs and outputs are enumerated in the column I/O. DFC is the abbreviation of discrete function cardinality which is a measure of the complexity of a multi-valued function and is calculated as product of its input cardinalities. s measure of the delay specify the columns LL the numbers of logic levels of the designed circuit. The columns a MM enumerates the number of MX- and MIN-bi-decompositions. ND is the abbreviation of non decomposable and count how many multi-valued functions could not decomposed by MX- or MIN-bi-decompositions in the case of DM. The number of MX-MIN multi-decompositions are given in the column MMM and the number of required literals are specified in the columns Lit. The run time is listed in seconds for the YDE decomposer on a 2.4 GHz Pentium IV computer with 512 M memory in the column Time. Table 2 shows a summarized direct comparison between the decomposer DM [4] and the new YDE decomposer [2] using the strategy SEPLL3 (YDE3) based on benchmark set of Table 1. The most important improvement of YDE is that all non decomposable functions could be decomposed by YDE3. The sum of MX gates, MIN gates, and literals is approximately the same for DM and YDE3, even though DM does not decompose 2453 multi-valued functions. n additional benefit of YDE3 is
6 I-DECOMP-MV YDE - SEPLL3 enchmark I/O DFC LL MM ND Lit DFC LL MM MMM Lit Time audiology 69/ balance 4/ ballon1 4/ breastc 9/ bridges1 9/ bridges2 19/ car 6/ chess1 6/ chess2 36/ cloud 6/ employ1 9/ employ2 7/ flag 28/ flare1 10/ flare2 10/ hayes 4/ lung-cancer 56/ mushroom 22/ programm 12/ sensory 11/ ships 4/ sleep 9/ sponge 44/ tic-tac-toe 9/ trains 32/ zoo 16/ Table 1. Experimental Results of I-DECOMP-MV and YDE - SEPLL3 Category DM YDE3 MIN/MX decompositions Non decomposed functions MIN-MX multi-decomposition MIN/MX gates Literals Logic levels Table 2. Comparison: DM - YDE-SEPLL3 that it needs 20 percent less logic levels. 6. Conclusion We suggested in this paper an approach that decomposes a MFI into a multi level structure of MX gates and MIN gates. This approach prefers the MX- and MIN-bi-decomposition for the strongest simplification. Completeness is ensured by MX-MIN multi-decomposition. References [1] M. Gao and R. rayton. Multi-valued multi-level network decomposition. In 10th International Workshop on Logic & Synthesis, pages , Granlibakken, US, June [2] C. Lang. i-decomposition of Function Sets using Multi- Valued Logic. Dissertation thesis, Freiberg University of Mining and Technology, Germany, [3] C. Lang and. Steinbach. Decomposition of multi-valued functions into min- and max-gates. In 31th IEEE International Symposium on Multiple-Valued Logic, pages , Warsaw, Poland, May [4]. Mishchenko,. Steinbach, and M. Perkowski. i-decomposition of multi-valued relations. In 10th International Workshop on Logic & Synthesis, pages 35 40, Granlibakken, US, June [5]. Mishchenko, C. Files, M. Perkowski,. Steinbach, and C. Dorotska. Implicit algorithms for multi-valued input support minimization. In 4th International Workshop on oolean Problems, pages 9 21, Freiberg, Germany, Sept [6] Portland Logic and Optimization Group. POLO Web Page. Portland State University, Oregon, US. URL pdx.edu/ polo/.
Derivative Operations for Lattices of Boolean Functions
Derivative Operations for Lattices of Boolean Functions Bernd Steinbach Institute of Computer Science Freiberg University of Mining and Technology Freiberg, Germany Email: steinb@informatik.tu-freiberg.de
More informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationSimpler Functions for Decompositions
Simpler Functions or Decompositions Bernd Steinbach Freiberg University o Mining and Technology, Institute o Computer Science, D-09596 Freiberg, Germany Abstract. This paper deals with the synthesis o
More informationAn Algorithm for Bi-Decomposition of Logic Functions
An Algorithm for Bi-Decomposition of Logic Functions Alan Mishchenko α Bernd Steinbach β Marek Perkowski α α Portland State University β Freiberg University of Mining and Technology Department of Electrical
More informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationBoolean cubes EECS150. Mapping truth tables onto cubes. Simplification. The Uniting Theorem. Three variable example
EES5 Section 5 Simplification and State Minimization Fall 2 -cube X oolean cubes Visual technique for indentifying when the uniting theorem can be applied n input variables = n-dimensional "cube" Y 2-cube
More informationCombinational Logic (mostly review!)
ombinational Logic (mostly review!)! Logic functions, truth tables, and switches " NOT, N, OR, NN, NOR, OR,... " Minimal set! xioms and theorems of oolean algebra " Proofs by re-writing " Proofs by perfect
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
More informationCompact XOR-Bi-Decomposition for Generalized Lattices of Boolean Functions
Compact XOR-Bi-Decomposition for Generalized Lattices of Boolean Functions Bernd Steinbach Institute of Computer Science Freiberg Universit of Mining and Technolog Freiberg, German Email: steinb@informatik.tu-freiberg.de
More informationIrredundant Sum-of-Products Expressions - J. T. Butler
On the minimization of SOP s for Bi-Decomposable Functions T. Sasao* & J. T. Butler *Kyushu Institute of Technology, Iizuka, JAPAN Naval Postgraduate School Monterey, CA -5 U.S.A. Outline Introduction
More informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
More informationDECISION DIAGRAM TECHNIQUES
vetlana N. Yanushkevich D. Michael Miller Vlad P. hmerko Radomir. tanković DECIION DIAGRAM TECHNIQUE FOR MICRO- AND NANOELECTRONIC DEIGN HANDBOOK CRC PRE Boca Raton Ann Arbor London Tokyo Contents Preface
More informationSum-of-Generalized Products Expressions Applications and Minimization
Sum-of-Generalized Products Epressions Applications and Minimization Tsutomu Sasao Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka 80-850 Japan Abstract This paper
More informationOn the Minimization of SOPs for Bi-Decomposable Functions
On the Minimization of SOPs for Bi-Decomposable Functions Tsutomu Sasao Jon T. Butler Center for Microelectronic Systems Department of Electrical and Department of Computer Science and Electronics and
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationChapter 4 Optimized Implementation of Logic Functions
Chapter 4 Optimized Implementation of Logic Functions Logic Minimization Karnaugh Maps Systematic Approach for Logic Minimization Minimization of Incompletely Specified Functions Tabular Method for Minimization
More informationMozammel H A Khan. Marek A Perkowski. Pawel Kerntopf
Multi-Output Galois Field Sum of Products Synthesis with New Quantum Cascades PORTLAND QUANTUM LOGIC GROUP Mozammel H A Khan East West University, BANGLADESH Marek A Perkowski Korea Advanced Institute
More informationPart 5: Digital Circuits
Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit
More informationCMSC 313 Lecture 19 Combinational Logic Components Programmable Logic Arrays Karnaugh Maps
CMSC 33 Lecture 9 Combinational Logic Components Programmable Logic rrays Karnaugh Maps UMC, CMSC33, Richard Chang Last Time & efore Returned midterm exam Half adders & full adders Ripple
More informationClasses of Bent Functions Identified by Specific Normal Forms and Generated Using Boolean Differential Equations
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 24, no. 3, December 2011, 357-383 Classes of Bent Functions Identified by Specific Normal Forms and Generated Using Boolean Differential Equations Bernd
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationWorking with combinational logic
Working with combinational logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and
More informationQuality of Minimal Sets of Prime Implicants of Boolean Functions
INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2017, VOL. 63, NO. 2, PP. 165-169 Manuscript received October 9, 2016; revised April, 2017. DOI: 10.1515/eletel-2017-0022 Quality of Minimal Sets of
More informationAn Application of Autocorrelation Functions to Find Linear Decompositions for Incompletely Specified Index Generation Functions
03 IEEE 43rd International Symposium on Multiple-Valued Logic An Application of Autocorrelation Functions to Find Linear Decompositions for Incompletely Specified Index Generation Functions Tsutomu Sasao
More informationInadmissible Class of Boolean Functions under Stuck-at Faults
Inadmissible Class of Boolean Functions under Stuck-at Faults Debesh K. Das 1, Debabani Chowdhury 1, Bhargab B. Bhattacharya 2, Tsutomu Sasao 3 1 Computer Sc. & Engg. Dept., Jadavpur University, Kolkata
More informationComplete Sets of Hamiltonian Circuits for Classification of Documents
Complete Sets of Hamiltonian Circuits for Classification of Documents Bernd Steinbach 1 and Christian Posthoff 2 1 Freiberg University of Mining and Technology, Institute of Computer Science, D-09596 Freiberg,
More information14:332:231 DIGITAL LOGIC DESIGN
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall Lecture #: Combinational Circuit Synthesis II hat if we have input variables? V = V = of Example with variables
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationBoolean Algebra. Sungho Kang. Yonsei University
Boolean Algebra Sungho Kang Yonsei University Outline Set, Relations, and Functions Partial Orders Boolean Functions Don t Care Conditions Incomplete Specifications 2 Set Notation $09,3/#0,9 438 v V Element
More informationBasing Decisions on Sentences in Decision Diagrams
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence Basing Decisions on Sentences in Decision Diagrams Yexiang Xue Department of Computer Science Cornell University yexiang@cs.cornell.edu
More informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization
Logic and omputer Design Fundamentals hapter 2 ombinational Logic ircuits Part 2 ircuit Optimization harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
More informationCOSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationEXACT MINIMIZATION OF AND-EXOR EXPRESSIONS OF PRACTICAL BENCHMARK FUNCTIONS
Journal of Circuits, Systems, and Computers Vol. 18, No. 3 (2009) 465 486 c World Scientific Publishing Company EXACT MINIMIZATION OF AND-EXOR EXPRESSIONS OF PRACTICAL BENCHMARK FUNCTIONS TAKASHI HIRAYAMA
More informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationThe matrix approach for abstract argumentation frameworks
The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced
More informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationPrinciples of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents
B-1 Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix B: Reduction of Digital Logic B-2 Chapter Contents B.1 Reduction of Combinational Logic and Sequential Logic B.2 Reduction
More informationVariable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION
Variable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION Dimitrios Voudouris, Marinos Sampson and George Papakonstantinou National Technical University of Athens, Greece. Abstract In this
More informationFault Equivalence, Dominance & Collapsing. Fault Equivalence
Fault Equivalence, Dominance & ollapsing Definition: If T a is the set of LL TVs which Detect Fault a, and T b is the set of LL TVs which Detect some other Fault b; the Two Faults a, and b are said to
More informationPLA Minimization for Low Power VLSI Designs
PLA Minimization for Low Power VLSI Designs Sasan Iman, Massoud Pedram Department of Electrical Engineering - Systems University of Southern California Chi-ying Tsui Department of Electrical and Electronics
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
More informationTwo-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit
11 41st IEEE International Symposium on Multiple-Valued Logic Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit Md. Mazder Rahman, Anindita Banerjee, Gerhard W. Dueck, and Anirban
More informationBoolean Algebra and logic gates
Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l Boolean
More informationReversible Function Synthesis with Minimum Garbage Outputs
Reversible Function Synthesis with Minimum Garbage Outputs Gerhard W. Dueck and Dmitri Maslov Faculty of Computer Science University of New Brunswick Fredericton, N.B. E3B 5A3 CANADA Abstract Reversible
More informationDecomposition of Multi-Output Boolean Functions - PRELIMINARY VERSION
Decomposition of Multi-Output Boolean Functions - PRELIMINARY VERSION Dimitrios Voudouris, Marios Kalathas and George Papakonstantinou National Technical University of Athens (funded by the project Protagoras/NTUA)
More informationENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem
More informationOptimizations and Tradeoffs. Combinational Logic Optimization
Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationImproved ESOP-based Synthesis of Reversible Logic
Improved ESOP-based Synthesis of Reversible Logic N. M. Nayeem Dept. of Math & Computer Science University of Lethbridge Lethbridge, AB, Canada noor.nayeem@uleth.ca J. E. Rice Dept. of Math & Computer
More informationLecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014
Lecture 2 Electronics ndreas Electronics oolean algebra and optimizing logic functions TF322 - Electronics Fundamentals ugust 24 Exercise ndreas ern University of pplied Sciences Rev. 946f32 2. of oolean
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationHeuristic Minimization of Two Level Circuits
Heuristic Minimization of Two Level Circuits Sungho Kang Yonsei University Outline Local Search Checking for Equivalence and Tautology Choosing the Right Direction Identifying Essential Implicants 2 Local
More informationThe Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,
More informationTestability of SPP Three-Level Logic Networks
Testability of SPP Three-Level Logic Networks Valentina Ciriani Anna Bernasconi Rolf Drechsler Department of Computer Science University of Pisa 561 Pisa, Italy {ciriani, annab}@di.unipi.it Institute of
More informationCMSC 313 Lecture 19 Homework 4 Questions Combinational Logic Components Programmable Logic Arrays Introduction to Circuit Simplification
CMSC 33 Lecture 9 Homework 4 Questions Combinational Logic Components Programmable Logic rrays Introduction to Circuit Simplification UMC, CMSC33, Richard Chang CMSC 33, Computer Organization
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationSolving Combinatorial Problems Using Boolean Equations
Solving Combinatorial Problems Using Boolean Equations Christian Posthoff The University of The West Indies St. Augustine Campus Trinidad & Tobago email: christian@posthoff.de Bernd Steinbach Freiberg
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationCSE 140, Lecture 2 Combinational Logic CK Cheng CSE Dept. UC San Diego
CSE 140, Lecture 2 Combinational Logic CK Cheng CSE Dept. UC San Diego 1 Combinational Logic Outlines 1. Introduction 1. Scope 2. Review of Boolean lgebra 3. Review: Laws/Theorems and Digital Logic 2.
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationTHE MULTIPLE-VALUED LOGIC.
By Marek Perkowski THE MULTIPLE-VALUED LOGIC. What is it? WHY WE BELIEVE IT HAS A BRIGHT FUTURE. Research topics (not circuit-design oriented) New research areas The need of unification Is this whole a
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions
ombinational logic Possible logic functions of two variables asic logic oolean algebra, proofs by re-writing, proofs by perfect induction Logic functions, truth tables, and switches NOT, N, OR, NN,, OR,...,
More informationarxiv: v1 [math.co] 19 Aug 2016
THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker
More informationSIMULATION-BASED APPROXIMATE GLOBAL FAULT COLLAPSING
SIMULATION-BASED APPROXIMATE GLOBAL FAULT COLLAPSING Hussain Al-Asaad and Raymond Lee Computer Engineering Research Laboratory Department of Electrical & Computer Engineering University of California One
More informationLogic Synthesis of EXOR Projected Sum of Products
Logic Synthesis of EXOR Projected Sum of Products Anna Bernasconi, Valentina Ciriani 2, and Roberto Cordone 2 Department of Computer Science, University of Pisa Italy, annab@di.unipi.it 2 DTI, University
More informationLogic Design Combinational Circuits. Digital Computer Design
Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional
More informationChapter 2 Fault Modeling
Chapter 2 Fault Modeling Jin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering National Central University Jungli, Taiwan Outline Why Model Faults? Fault Models (Faults)
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationA Fast Method to Derive Minimum SOPs for Decomposable Functions
A Fast Method to Derive Minimum SOPs for Decomposable Functions Tsutomu Sasao Center for Microelectronic Systems and Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka,
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationAn Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints Khalil Djelloul Laboratoire d Informatique Fondamentale d Orléans. Bat. 3IA, rue Léonard de Vinci. 45067 Orléans,
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationMulti-Level Logic Optimization. Technology Independent. Thanks to R. Rudell, S. Malik, R. Rutenbar. University of California, Berkeley, CA
Technology Independent Multi-Level Logic Optimization Prof. Kurt Keutzer Prof. Sanjit Seshia EECS University of California, Berkeley, CA Thanks to R. Rudell, S. Malik, R. Rutenbar 1 Logic Optimization
More informationIntroduction to Functions
Mathematics for Economists Introduction to Functions Introduction In economics we study the relationship between variables and attempt to explain these relationships through economic theory. For instance
More informationSimlification of Switching Functions
Simlification of Switching unctions ( ) = ( 789 5) Quine-Mc luskey Original nonminimized oolean function m i m i m n m i [] m m m m m 4 m 5 m 6 m 7 m 8 m 9 m m m m m 4 m 5 m m m 7 m 8 m 9 m m 5 The number
More informationTechnical Report: Projects & Background in Reversible Logic
Technical Report: Projects & Background in Reversible Logic TR-CSJR1-2005 J. E. Rice University of Lethbridge j.rice@uleth.ca 1 Introduction - What is Reversible Logic? In order to discuss new trends and
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationQuantum Multiple-Valued Decision Diagrams Containing Skipped Variables
Quantum Multiple-Valued Decision Diagrams Containing Skipped Variables DAVID Y. FEINSTEIN 1, MITCHELL A. THORNTON 1 Innoventions, Inc., 1045 Bissonnet Street, Houston, TX, USA Dept. of Computer Science
More informationRegular Sparse Crossbar Concentrators
Regular Sparse Crossbar Concentrators Weiming Guo and A. Yavuz Oruç Electrical Engineering Department College Park, MD 20742 ABSTRACT A bipartite concentrator is a single stage sparse crossbar switching
More informationMatroids/1. I and I 2 ,I 2 > I 1
Matroids 1 Definition A matroid is an abstraction of the notion of linear independence in a vector space. See Oxley [6], Welsh [7] for further information about matroids. A matroid is a pair (E,I ), where
More informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
More information