M. Karnaugh. A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics, 72(I):593--599, November. 1953.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....which are well known in the computer design area and have been widely used in the past. Set covering techniques have many applications in computer design, such as two levels logic minimization, two levels Boolean relation minimization, state minimization, exact encoding and DAG covering [11][12] 13] and for optimal encoding of microprocessor instructions [14] Moreover, they were exploited for test compaction in the testing field [15] In the present paper, starting from an initial reseeding solution, a minimal one is computed by resorting to typical set covering techniques, based ....

M. Karnaugh, The Map Method for Synthesis of Combinational Logic Circuits, Transaction IEEE, vol. 72, pp 593-599, 1953

....can be applied iteratively until no more new aggregated holes are discovered. Figure 5 shows how the five tasks 0,2 , 0,3 , 7,2 , 7,3 , and 7,4 can be aggregated together until only the holes 0,7 and 7, 2,3,4 remain. This technique is similar to Karnaugh binary mapping [8] and is useful for much the same reasons. 3.2 Partitioned Holes A second technique for performing hole analysis is to group together holes that have been defined to be conceptually similar. Grouping is done according to semantic partitioning of the attribute values provided by the user when ....

M. Karnaugh. The map method for synthesis of combinational logic circuits. Transactions of the American Institute of Electrical Engineers, 72(9):593--599, November 1953.

....term gives the following minimal equation. qabbcac= Although this equation can be minimized by inspection and by the application of Boolean identities, more systematic methods are required to assure the quality of a digital design. The two most important systematic methods are Karnaugh maps [KARN53] and Quine McClusky minimization [Quin52] MCCL56] 1.3 Minimization of Boolean Equations In a Boolean expression such as the following, the terms ab, bc, ac, and abc, are known as the prime implicants of the function q. Note that the term abc contains all input variables, while the term ab ....

Karnaugh, M. "A Map Method for the Synthesis of Combinational Logic Circuits," Trans. AIEE, Comm. and Electronics, Vol. 72, Part I (November 1953), 593-99.

....transition. The following table lists the notation for these four Boolean variables: TABLE 2. Boolean Variable Characterization of Sequences For a given sequence, the truth value of these four Boolean variables can be independently tested. Figure 2. shows the four variable Karnaugh map [7,8,11] partition of the sequences. There are sixteen cells in the Karnaugh map (for compactness in notation we will call it K map) shown in Figure 2. These cells are labeled 0 through 15 and each cell corresponds to one of the 16 possible states of the Boolean variables defined in Table 2. For example, ....

Karnaugh, M., "The Map Method for Synthesis of Combinational Logic Circuits," Trans. AIEE. pt. I, vol. 72, no. 9, p. 593-599, 1953.

....also applicable to our problem. The argument in our case is that the complexity of sending an additional message is far greater that of adding an extra key ID in the message to indicate that the key should be used as input in deriving a new key. In deriving a minimal expression, the Karnaugh map [2] representation of boolean functions can be used. Karnaugh maps provide an intuitive visual technique that helps to identify product terms. However, for large number of variables this method becomes hard to use since it is essentially a trialand error method that relies on the ability to ....

M. Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits", Transactions AIEE, Communications and Electronics,Vol. 72, pp. 593-599, November1953.

....and is known to be a very powerful tool in certain domains. In our current work we wish to nd a way to use the GA as a design tool, with particular emphasis in the design of digital combinational circuits. As it is known, there are several standard graphical design aids such as the Karnaugh Maps (Karnaugh 1953, Veitch 1952) which are widely used by human 1 designers. There are also other tools more suitable for computer implementation such as the Quine McCluskey Method (Quine 1955, McCluskey 1956) Espresso (Brayton, Hachtel, McMullen Sangiovanni Vincentelli 1984) and MisII (Brayton, Rudell, ....

....introduce our approach, giving some examples of its performance. Results are compared against those produced by our previous approach (a GA with an n cardinality alphabet and a two stage tness function that we will simply denote as NGA) and against designs produced by humans (using Karnaugh Maps (Karnaugh 1953), the Quine McCluskey Procedure (Quine 1955, McCluskey 1956) and another GA (Miller, Thomson Fogarty 1997) Then, we present a short discussion of our results, our conclusions and some of the possible paths of future research. 2 Multiobjective Optimization Multiobjective optimization (also ....

Karnaugh, M. (1953), `A Map Method for Synthesis of Combinational Logic Circuits', Transactions of the AIEE, Communications and Electronics 72 (I), 593-599.

....SOP form, or, as few logic AND operations as possible occur in the POS form. This subset of two level minimization problems is loosely referred to as minimizing a Boolean function by many logic designers. Although many well known techniques have been developed for minimizing SOP and POS forms [6] [7] this problem is provably hard. It can be shown that nding the exact solution to the two level minimization problem involves nding the solution to the subproblems commonly known as the set covering problem (for unate functions) and the minimum cost as This project was supported by NSF ....

M. Karnaugh. The map method for synthesis of combinational logic circuits. Transactions of A.I.E.E., 72(pt. 1):593-599, Nov. 1953.

....GA as a design tool, with particular emphasis in the design of combinational circuits. The design process for combinational logic circuits has evolved from its first notions [36] to a standard element of undergraduate computing curricula [34] Standard graphical design aids such as Karnaugh Maps [18, 41] are widely used and tools suitable for computer implementation have evolved from the Quine McCluskey Method [32, 26] to freely available tools such as Espresso [2] and MisII [3] and many commercial products. Probably the earliest attempt to evolve circuits is Friedman s thesis, that dates back ....

....prone. Its success depends on our ability to recognize the application of a theorem or a postulate during the minimization process. Such recognition may not be obvious. Furthermore, there is no general set of rules to aid that recognition. Two popular minimization techniques are the Karnaugh Map [18], which is based on a graphical representation of Boolean functions, and the QuineMcCluskey Procedure [32, 26] which is a tabular method. Both of these methods are mechanical in nature. Karnaugh Maps are useful in minimizing functions with up to five or six variables. The Quine McCluskey ....

M. Karnaugh. A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics, 72 (I):593--599, November 1953.

....our approach and give some examples of its performance. Results are compared against those produced by our previous approach (a GA with an n cardinality alphabet and a two stage fitness function that we will simply denote as NGA) and against designs produced by humans (using Karnaugh Maps [14] and the QuineMcCluskey Procedure [20, 15] Then, we present our conclusions and some of the possible paths of future research. 2. Related Work The idea of using multiobjective optimization techniques to handle constraints is not new. Some researchers have proposed to redefine the ....

M. Karnaugh. A Map Method for Synthesis of Combinational Logic Circuits. Transactions of the AIEE, Communications and Electronics, 72 (I):593--599, November 1953.

....also applicable to our problem. The argument in our case is that the complexity of sending an additional message is far greater that of adding an extra key ID in the message to indicate that the key should be used as input in deriving a new key. In deriving a minimal expression, the Karnaugh map [2] representation of boolean functions can be used. Karnaugh maps provide an intuitive visual technique that helps to identify product terms. However, for large number of variables this method becomes hard to use since it is essentially a trialand error method that relies on the ability to ....

M. Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits", Transactions AIEE, Communications and Electronics, Vol. 72, pp. 593-599, November 1953.

....which are of interest to the buyer as shown in Table 1. The buyer decides that the goal is to discriminate items that sold less than 100 units from those that sold more than 10,000 using these attributes. The scenario is illustrated in Fig. 1, using a modified Karnaugh Map representation (Karnaugh, 1953). Attribute Values Abbreviation Type Plate or Bowl P or B Size Small or Large S or L Colour White or Yellow W or Y Price Regular or Discount R or D Table 1 Scenario Values In each case, a single cell represents a simple conjunction of attributes. So, for example, the cell identified by the ....

M. Karnaugh (1953). The Map Method for Synthesis of Combinational Logic Circuits, AIEE Trans. on Communication and Electronics, 72:593-599.

....5:000 x 4 15:000. The values of all variables were considered with a 3 decimal precision. The total population size used was 160 (20 individuals for each of the 8 sub populations) and the maximum number of generations was 150. 5. 3 Example 3 This example was solved by hand using Karnaugh Maps [40] by an experienced designer. His solution required 5 gates, as shown in Table 6. Also, a computer program called ESPRESSO [41] was used to compare the results produced by the approach proposed in this paper. It should be mentioned that ESPRESSO really tries to produce a minumum representation of a ....

Karnaugh, M. (November 1953). A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics , 72 (I):593--599.

....(GA) as a design tool, with particular emphasis in the design of combinational circuits. The design process for combinational logic circuits has evolved from its first notions [3] to a standard element of undergraduate computing curricula [4] Standard graphical design aids such as Karnaugh Maps [5, 6] are widely used and tools suitable for computer implementation have evolved from the Quine McCluskey Method [7, 8] to freely available tools such as Espresso [9] and MisII [10] and many commercial products. Louis [11] is one of few sources found in the literature to address the use of GAs for ....

....prone. Its success depends on our ability to recognize the application of a theorem or a postulate during the minimization process. Such recognition may not be obvious. Furthermore, there is no general set of rules to aid that recognition. Two popular minimization techniques are the Karnaugh Map [5], which is based on a graphical representation of Boolean functions, and the Quine McCluskey Procedure [7, 8] which is a tabular method. Both of these methods are mechanical in nature. Karnaugh Maps are useful in minimizing functions with up to five or six variables. The QuineMcCluskey Procedure ....

Karnaugh, M. (1953) A map method for synthesis of combinational logic circuits, Transactions of the AIEE, Communications and Electronics, 72, No. I, pp. 593--599.

....GA as a design tool, with particular emphasis in the design of combinational circuits. The design process for combinational logic circuits has evolved from its first notions [29] to a standard element of undergraduate computing curricula [27] Standard graphical design aids such as Karnaugh Maps [14, 32] are widely used and tools suitable for computer implementation have evolved from the Quine McCluskey Method [26, 22] to freely available tools such as Espresso [2] and MisII [3] and many commercial products. Probably the earliest attempt to evolve circuits is Friedman s thesis, that dates back to ....

....prone. Its success depends on our ability to recognize the application of a theorem or a postulate during the minimization process. Such recognition may not be obvious. Furthermore, there is no general set of rules to aid that recognition. Two popular minimization techniques are the Karnaugh Map [14], which is based on a graphical representation of Boolean functions, and the Quine McCluskey Procedure [26, 22] which is a tabular method. Both of these methods are mechanical in nature. Karnaugh Maps are useful in minimizing functions with up to five or six variables. The QuineMcCluskey ....

M. Karnaugh. A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics, 72 (I):593--599, November 1953.

....algorithms. 1 Introduction Prime implicates implicants (PIs) were a topic of great interest to researchers in the early days of computer science, in part because of their use in procedures for boolean function minimization [Quine 52] A number of algorithms were developed, including [Quine 52] Karnaugh 53] McCluskey 56] Tison 67] Slagle et al. 70] Hong et al. 74] Interest in PIs, which has declined with the development of new circuitry minimization technologies, has renewed in recent years when they were This research was supported in part by a graduate fellowship ARO Grant ....

Karnaugh, G., The Map Method for Synthesis of Combinational Logic Circuits. AIEE Trans. Communications and Electronics, vol. 72, pp. 593-599, 1953.

....also applicable to our problem. The argument in our case is that the complexity of sending an additional message is far greater that of adding an extra key ID in the message to indicate that the key should be used as input in deriving a new key. In deriving a minimal expression, the Karnaugh map [2] representation of boolean functions can be used. Karnaugh maps provide an intuitive visual technique that helps to identify product terms. However, for large number of variables this method becomes hard to use since it is essentially a trialand error method that relies on the ability to ....

M. Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits", Transactions AIEE, Communications and Electronics, Vol. 72, pp. 593-599, November 1953.

No context found.

M. Karnaugh. A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics, 72(I):593--599, November. 1953.

No context found.

M. Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits," Trans. AIEE, Pt. I, Vol. 79, No. 9, pp. 593--599, 1953.

No context found.

Karnaugh M., The map method for synthesis of combinational logic circuits. Trans. P. I. oncations and Elec- tronics, pp. 59-599, 1953.

No context found.

Karnaugh, G., The Map Method for Synthesis of Combinational Logic Circuits. AIEE Trans. Communications and Electronics, vol. 72, pp. 593-599, 1953.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC