Three Models and Some Theorems on Decomposition of Boolean Functions
|
|
- Scot Chapman
- 5 years ago
- Views:
Transcription
1 Three Models and Some Theorems on Decomposition of Boolean Functions Steinach, Bernd Freierg University of Mining and Technology Zarevsij, Aradij Institute of Engineering Cyernetics of the NAS of Belarus Astract The prolem of parallel decomposition f () = ϕ ( µ (u), λ (v) ) of an incompletely specified Boolean function y = f () is regarded for aritrary susets u and v of the set of variales. Seven possile properties of f () are formulated in terms of the three suggested models: ipartite graph, ternary matri and mar functions. Revealing decomposaility of f () and constructing proper Boolean functions ϕ, µ and λ are reduced to checing f () for these seven properties. A fast algorithm solving the prolem is proposed and results of eperiments are presented. 1 Introduction Traditionally, any decomposition of a Boolean function is regarded as its representation y a composition of several functions with a smaller numer of variales. This prolem has important practical applications, and many pulications have een devoted to it [1-6, 8-18 and others]. Depending on the structure of the circuit, we distinguish different approaches for decomposition [1, 3, 5]. In this paper we focus on one ind of decomposition called Grouping in [3, 6, 10, 11, 12, 13, 14] or Bi-Decomposition in [9]. It is well nown [3, 6, 9], that such a decomposition does not eist for all Boolean functions. In [9] are considered disjoint (see Figure 1a) and one-variale-non-disjoint Bi- Decomposition of completely specified Boolean functions. The prospects for finding a Grouping enlarge enormously if we consider multivariale-non-disjoint groupings (see Figure 1) of incompletely specified Boolean functions. Therefore, we select this approach in our paper. From previous wor we now, that different inds of groupings are possile. Nevertheless, the results otained so far do not completely cover the prolem, especially in the case of parallel decomposition considered in this paper. Let = ( 1, 2,..., n ) e a vector of Boolean variales, y = f () - an incompletely specified Boolean function specified on set D of some values of vector, and let u and v e some susets from. Parallel decomposition of function f on the pair u, v means otaining a composition ϕ(µ(u), λ(v)) of three Boolean functions ϕ, µ and λ which realizes function f, i.e. coincides with it on the area of definition of the latter. We regard the conditions of eistence of such a composition and the rules for defining functions ϕ, µ and λ. µ ( u ) a µ ( u ) ϕ f ( ) ϕ f ( ) λ ( v ) c λ ( v ) ( a ) ( ) Figure 1. Structure of the decomposition y grouping - ( a ) disjoint, ( ) non-disjoint
2 2 Preliminaries In this paper we use some operations from the Boolean Differential Calculus [2]. Definition 1 The -times Maimum-Operation is defined as: ma f ( 0, 1) = ma... ma ma f ( 0, 1) where ma f, = f, = 1 f, = 0. i ( 0 i ) ( 0 i ) ( 0 i ) The -times maimum of a Boolean function f( 0, 1 ) in 1 - direction forms another function f '( 0 ) which has the value 1 for all those inputs 0 for which the original function f( 0, 1 ) has the value 1 at least once in the suspace 0 = const. Definition 2 The -times Minimum-Operation is defined as: min f ( 0, 1) = min... min min f ( 0, 1) where min f (, ) f (, 1 ) f (, 0 ) i = = =. 0 i 0 i 0 i The -times minimum of a Boolean function f( 0, 1 ) in 1 - direction forms another function f '( 0 ) which has the value 1 for all those inputs 0 for which the original function f( 0, 1 ) has the value 1 in the whole suspace 0 = const. Definition 3 The vectored Maimum-Operation is defined as: ( 0 1) ( 0 1) ( 0 1) ma f, = f, f,. 1 The vectored maimum of a Boolean function f( 0, 1 ) in 1 - direction forms another function { } f '( 0, 1 ) which has the value 1 for all those pairs of inputs ( ) ( ) function f( 0, 1 ) has the value 1 at least once in this pair of inputs. 3 Models and Properties 3.1 First Model: Bipartite Graph G,,, for which the original Let us denote A and B the sets of different projections of elements from D onto u and v, correspondingly. We construct the function g: A B {1, 0, } it in such a way: for any a i A and j B, if there eists d D with projections onto u and v equal correspondingly to a i and j, then g(a i, j ) = f (d ); if such d does not eist, then g(a i, j ) =. Figure 2 shows a Boolean function f (a,, c, d, e) defined on set D and sets A and B of projections of elements from D onto u = (a,, c) and v = (, c, d, e). a c d e f D = a c A = c d e B = Figure 2. Incompletely specified Boolean function f (a,, c, d, e) and sets A and B
3 The function g can e represented y a ipartite graph G (see Figure 3). The vertices of this graph correspond to elements of sets A and B and are mared in the same way, and it has edges of two types: vertices a i and j are connected y a 1-edge (old line) if g(a i, j ) = 1, and y a 0-edge (dotted line) if g(a i, j ) = 0. Edges of these two types can form multitype chains in graph G, which will e denoted similarly, for eample, 0101-chain consists of consequently connected 0- edge, 1- edge, 0- edge and 1- edge. Consider now the following properties of graph G: 1 a 1 2 a 2 3 a 3 4 Figure 3. The ipartite graph G p 1 the graph contains a 1-edge; p 2 the graph contains a 0- edge; p 3 the graph contains a 10-chain passing through a verte from A; p 4 the graph contains a 10-chain passing through a verte from B; p 5 the graph contains a 010-chain; p 6 the graph contains a 101-chain; the graph contains a cycle with odd numer of 1-edges, i.e. it is non-dichromatic. p Second Model: Ternary Matri T The function g can also e represented y a ternary matri T, in which t i j = g(a i, j ). The rows of this mari correspond to the elements of set A and the columns - to the elements of set B, respectively. Note, that the ternary matri T can e regarded as the matri of adjacency of the ipartite graph G. Figure 4 shows the matri T corresponding to the ipartite graph G from Figure 3. Let us epress the same seven properties in terms of the matri T representation, calling compound a vector containing oth elements 1 and 0: a T = a a Figure 4. The Ternary matri T p 1 matri T contains a 1-element; p 2 matri T contains a 0-element; p 3 matri T contains a compound row; p 4 matri T contains a compound column; p 5 matri T contains a 1-element on an intersection of compound row and column; p 6 matri T contains a 0-element on an intersection of compound row and column; p 7 the set of rows of matri T is incompatile, which means that it is impossile to get rid of 1- elements y successive componentwise inversion of rows and columns of the matri. 3.3 Third Model: Mar Functions q() and r() The incompletely specified Boolean function f () can e represented y ON-set and OFF-set. The mar functions q() = 1 ON-set and r() =1 OFF-set are completely specified functions. Let us define the susets of more in detail: = ( a,, c ), u = ( a, c ) and v = (, c ). By means of the mar functions q() and r() and some operation of the Boolean Differential Calculus [2] we get the following list of the enumerated aove properties: p 1 q() 0 p 2 r() 0 p 3 ma q ma r 0 a a p 4 ma q ma r 0
4 p 5 q ma r ma r 0 a p 6 r ma q ma q 0 a p 7 ( ) ' a, ' q r q r a ma ma ma ma min min 0 ' ' ' ' ' ' a a a a The mar functions q() and r() in the formula of property p 7 are enlarged in such a way, that property p 7 can e detected using only the 4 values f ( 0, 0, 0), f ( 0, 0, 1), f ( 0, 1, 0) and f ( 0, 1, 1). You find a more detailed discussion of these properties in [10]. These definitions facilitate consideraly checing a Boolean function on possession of the indicated properties. It is important inasmuch as is shown elow that the regarded prolem of decomposition is reduced to such a checing. Note, for real calculation of the aove formulas each representation of completely specified Boolean functions, e.g. inary decision diagram s (BDD s) [7] or lists of ternary vectors (TVL s) [4] can e used. 4 Theorems T h e o r e m 1. If the graph G, the ternary matri T or the mar functions [q, r] have one of the properties p 5, p 6 or p 7, they have also the properties p 3 and p 4. a a Because the graph G has any of the properties p 5, p 6 or p 7 the graph has some chains which contain suchains with properties p 3 and p 4. It follows from each of the properties p 5, p 6 and p 7 of ternary matri T that there eists at least one compound row and one compound column in T. The [q, r]-formulas of the properties p 3 and p 4 remain right, removing eactly one ma -operation [6]. From q ma r ma r 0 q ma r 0 follows p 5 p 3. By means of similar transformation it can e shown, that each of the properties p 5, p 6 or p 7 implies the properties p 3 and p 4. T h e o r e m 2. If the graph G, the ternary matri T or the mar functions [q, r] possess the properties p 3 or p 4, they possess also properties p 1 and p 2. The proof is similar to the previous one. Each of the enumerated properties of graph G puts some restrictions on the two-variale Boolean function ϕ in the sought-for composition ϕ(µ(u), λ(v)). The set of such restrictions constitutes a an relation etween the set of properties {p 1, p 2,..., p 7 } and the set {ϕ 0, ϕ 1,..., ϕ 15 } of different two-variale Boolean functions, shown elow in the tale 1. Tale 1. Definition of functions ϕ i µ λ ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 6 ϕ 7 ϕ 8 ϕ 9 ϕ 10 ϕ 11 ϕ 12 ϕ 13 ϕ 14 ϕ
5 T h e o r e m 3. The Boolean matri B shown elow represents the an relation: i j = 1 means that p i (ϕ ϕ j ). If graph G possesses the property p i and i j = 1 then the given Boolean function cannot e realized y a composition ϕ(µ(u), λ(v)) where ϕ = ϕ j. ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 6 ϕ 7 ϕ 8 ϕ 9 ϕ 10 ϕ 11 ϕ 12 ϕ 13 ϕ 14 ϕ 15 p p p B = p p p p The modus tollens rule could e used for proving assertions corresponding to each 1 of the tale. For eample, suppose there eists a composition of the regarded type with ϕ = ϕ 7 (disjunction) when graph G has property p 5. To define functions µ(u) and λ(v) we have to mar vertices of graph G with 1s and 0s. By that every verte incident to a 0-chain should e mared with 0, and at least one verte incident to a 1-chain should e mared with 1. When graph G has property p 5 it has a 010-chain containing two 0-suchains and one 1-suchain and it is impossile to mar four incident vertices in such a way as to satisfy all these conditions. So the supposition is false. T h e o r e m 4. The shown elow Boolean matri C represents the necessary and sufficient conditions for eistence of a composition ϕ j (µ(u), λ(v)) (with a concrete function ϕ j ) which realizes f(): c i j = 1 means that such a composition eists if and only if graph G does not possess property p i. ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 6 ϕ 7 ϕ 8 ϕ 9 ϕ 10 ϕ 11 ϕ 12 ϕ 13 ϕ 14 ϕ 15 p p p C = p p p p The necessity of the conditions follows from Theorem 3, the sufficiency is proved y showing how to construct the regarded composition (see Theorem 6 for that). It could e convenient to use the conventional division of two-variale Boolean functions into four classes: (1) constants (ϕ 0, ϕ 15 ), (2) functions depending on one variale only (ϕ 3, ϕ 5, ϕ 10, ϕ 12 ), (3) non-linear functions of two variales (ϕ 1, ϕ 2, ϕ 4, ϕ 8 - conjunctions of variales which could e inverted, ϕ 7, ϕ 11, ϕ 13, ϕ 14 - disjunctions) and (4) linear functions of two variales (ϕ 6, ϕ 9 ).
6 The properties can e divided similarly into four classes: P 1 = {p 1, p 2 }, P 2 = {p 3, p 4 }, P 3 = {p 5, p 6 }, P 4 = {p 7 }. The asence of some property from class P i when regarding some Boolean function means that it can e represented y the composition ϕ(µ(u), λ(v)) with ϕ chosen from the corresponding class numer i. It is easy to notice that the three last rows of the matri B constitute its only irredundant cover. From aove arguments follows theorem 5. T h e o r e m 5. An incompletely specified Boolean function can e realized y a composition ϕ(µ(u), λ(v)), if and only if at least one of the following conditions is satisfied: p 5 - the corresponding graph G does not contain 010-edges; p 6 - graph G does not contain 101-edges; p 7 - graph G does not contain cycles with odd numer of 1-edges. The following theorem shows how to find proper functions ϕ, µ and λ when some of the conditions p 5, p 6, p 7 are satisfied. T h e o r e m 6. If condition p 5 is satisfied, function f can e realized y a composition µ(u) λ(v) in which µ(a i ) and λ( j ) tae value 0 when g(a i, j ) = 0 and value 1 otherwise. If condition p 6 is satisfied, function f can e realized y a composition µ(u) λ(v) in which µ(a i ) and λ( j ) tae value 1 when g(a i, j ) = 1 and value 0 otherwise. If condition p 7 is satisfied, function f can e realized y a composition µ(u) λ(v). In the latter case the vector of values of function λ(v) on the set B is otained y matching rows of matri T - deleting orthogonality etween the rows y componentwise inversion of some of them, and the vector of values of function µ(u) on the set A taes value 1 in the components corresponding to inverted rows and value 0 in the remaining ones. Using the third model we get p 5 q ma r ma r = 0, the condition for OR-decomposition µ(u) λ(v) a p 6 r ma q ma q = 0, the condition for AND-decomposition µ(u) λ(v) a nown from [3]. The condition p 7 for EXOR-decomposition is proved in [10]. E a m p l e A\B µ T = λ The matri T shown aove has properties p 5 and p 6, ut not p 7. Hence, the function f () corresponding to it could e realized y a composition µ(u) λ(v). The values of functions µ(u) and λ(v) on sets A and B are shown on the right side and elow the matri, correspondingly.
7 5 Eperimental Results In practical applications of decomposition we have to chec the three inds of groupings for many incompletely specified Boolean functions and many disjoint / non-disjoint partitions of variales very often. Therefore, we need fast algorithms and programs and have to compare our three models relating this aim. We suppose that the first two models have similar properties of computational compleity. The first model (ipartite graph G) is very helpful for perception and understanding, whereas the second one (ternary Matri T) is more convenient for programming. Quite different is the third model, ecause the mar functions q() and r() have no relationship to the susets A and B. For the eperiments we use the representation of q() and r() y TVL's and their calculation y the XBOOLE system [4]. For comparison we use the following eperiment. In the range of n = 6,..., 16 variales we generate incompletely specified Boolean random functions defined on m input cominations. In ranges of m = [1,..., 20] + 20 *, = 0,..., 8, we select 10 such pseudo random functions and calculate all inds of disjoint decompositions. The numers of variales in sets of u and v are equal or differ y one. Results of these eperiments on a PC Pentium 200 MHz are presented in tale 2 for model 2 and tale 3 for model 3. Tale 2. Time in milliseconds for parallel decomposition using model 2 - ternary matri T n m Tale 3. Time in milliseconds for parallel decomposition using model 3 - mar functions [q(), r()] n m Conclusion The algorithm for a Boolean function decomposition ased on the theorems formulated aove seems to e rather fast. Its computational compleity is O(n m 2 ) or even O(m 2 ) - when vector operations (over vectors of the function values) are availale. Here n is the numer of variales, m - the size of the definition area D.
8 Using the third model, our algorithm needs in general and especially for a large definition area D the shortest time for calculation. Note, in this case the time for checing EXOR grouping is nearly ten times the time for checing AND and OR grouping. The real time of some milliseconds for the analysis relating all possile decompositions of an incompletely specified Boolean function and given susets of variales is a good asis for future applications of this approach. 7 Acnowledgments We lie to epress our gratitude to the assistant Mrs. B. Steffen and postgraduate student A. Peryshin for programming and conducting eperiments. 8 References [1] Ashenhurst, R. L.: The decomposition of switching functions. - Proceedings of an International Symposium on the Theory of Switching, April 1957, pp [2] Bochmann, D.; Posthoff, Ch.: Binäre dynamische Systeme. - Aademie-Verlag, Berlin, [3] Bochmann, D.; Dresig, F.; Steinach B.: A new decomposition method for multilevel circuit design. - EDAC-91, Amsterdam, pp [4] Bochmann, D.; Steinach, B.: Logientwurf mit XOOLE, Verlag Techni, Berlin [5] Curtis, H. A.: Design of Switching Circuits. - Van Nostrand, Princeton, N. J., [6] Dresig, F.: Gruppierung - Theorie und Anwendung in der Logisynthese. Dissertation, Fortschritt - Berichte VDI, Reihe 9 Nr. 1445, VDI - Verlag, Düsseldorf, [7] Drechsler, R.; Becer, B.: Graphenasierte Funtionsdarstellungen. B. G. Teuner, Stuttgart, [8] Sasao, T.: FPGA design y generalized functional decomposition. - Logic synthesis and optimization (Ed. y Sasao T.), Kluwer Academic Pulishers, Boston / London / Dordrecht, 1993, pp [9] Sasao, T.; Butler, J.T.: On Bi-Decomposition of Logic Functions, ACM/IEEE International Worshop on Logic Synthesis, Tahoe City, California, May 18-21, Volume 2, pp. 1-6, [10] Steinach, B.; Wereszczynsi, A.: Synthesis of multilevel circuits using EXOR-gates. - Proceedings of IFIP WG 10.5 Worshop on Application of the Reed-Muller Epansion in Circuit Design, Chia-Mauhary, Japan, 1995, pp [11] Stöcert, M.; Steinach, B.: Design of Fully Testale Circuits y Functional Decomposition and Implicit Test Pattern Generation, Proceedings of the 12th IEEE VLSI Test Symposium, 1994, pp [12] Steinach, B.; Zhang, Z.: Synthesis for Full Testaility of Large Partitioned Cominational Circuits, in: Steinach, B. (Hrsg.): Boolesche Proleme, Proceedings 2. Worshops, 19/20. Sep. 1996, TU Bergaademie Freierg, S [13] Steinach, B.; Zhang, Z.: Designing for Testaility of Long Pipeline of Modules, in: Anheier, W.; Pöhl, F. (Hrsg.): Tagungsand - 9. Worshop "Testmethoden und Zuverlässigeit von Schaltungen und Systemen", Report 1/97, Berichte Eletrotechni, Universität Bremen, 1997, S [14] Steinach, B.; Zhang, Z.: Synthesis for Full Testaility of Partitioned Cominational Circuits Using Boolean Differential Calculus, Proc. of IEEE/ACM International Worshop on Logic Synthesis 1997 (IWLS'97 - Synthesis in the Sierra), Granliaen Resort - Tahoe City, CA - USA, 1997, pp [15] Wan, W.; Perowsi, M. A.: A new approach to the decomposition of incompletely specified multi-output functions ased on graph coloring and local transformations and its application to FPGA mapping. - Proceedings of Euro DAC 92, [16] Zarevsij, A. D.: An algorithm for decomposition of Boolean functions. - Trudy SPhTI, is. 44, 1964, Toms, pp (in Russian). [17] Zarevsij, A. D.: PLA decomposition over input variales. - Dolady AN B, 1980, v.24, No 5, pp (in Russian). [18] Zarevsij, A. D.: On a special type decomposition of wealy specified Boolean functions. Proceedings of the Second International Conference on CAD of Discrete Devices, Mins, 1997, v.1, pp
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 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 informationMinimizing a convex separable exponential function subject to linear equality constraint and bounded variables
Minimizing a convex separale exponential function suect to linear equality constraint and ounded variales Stefan M. Stefanov Department of Mathematics Neofit Rilski South-Western University 2700 Blagoevgrad
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 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 informationDetecting Support-Reducing Bound Sets using Two-Cofactor Symmetries 1
3A-3 Detecting Support-Reducing Bound Sets using Two-Cofactor Symmetries 1 Jin S. Zhang Department of ECE Portland State University Portland, OR 97201 jinsong@ece.pdx.edu Malgorzata Chrzanowska-Jeske Department
More informationx 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11 x 12 x 13 x 14 x 15 x 16
DECOMPOS: An Integrated System for Functional Decomposition Tsutomu Sasao and Munehiro Matsuura Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka 820-8502, Japan Abstract
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 informationPolynomial Degree and Finite Differences
CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial
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 informationLUTMIN: FPGA Logic Synthesis with MUX-Based and Cascade Realizations
LUTMIN: FPGA Logic Synthesis with MUX-Based and Cascade Realizations Tsutomu Sasao and Alan Mishchenko Dept. of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 80-80, Japan Dept.
More informationThe Final Exam is comprehensive but identifying the topics covered by it should be simple.
Math 10 Final Eam Study Guide The Final Eam is comprehensive ut identifying the topics covered y it should e simple. Use the previous eams as your primary reviewing tool! This document is to help provide
More informationExact SAT-based Toffoli Network Synthesis
Eact SAT-based Toffoli Network Synthesis ABSTRACT Daniel Große Institute of Computer Science University of Bremen 28359 Bremen, Germany grosse@informatik.unibremen.de Gerhard W. Dueck Faculty of Computer
More informationUSING SAT FOR COMBINATIONAL IMPLEMENTATION CHECKING. Liudmila Cheremisinova, Dmitry Novikov
International Book Series "Information Science and Computing" 203 USING SAT FOR COMBINATIONAL IMPLEMENTATION CHECKING Liudmila Cheremisinova, Dmitry Novikov Abstract. The problem of checking whether a
More informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
More informationLogic Synthesis for Layout Regularity using Decision Diagrams *
Logic Synthesis for Layout Regularity using Decision Diagrams * Malgorzata Chrzanowska-Jeske, Alan Mishchenko 2, Jinsong Zhang, and Marek Perkowski Department of ECE, Portland State University, Portland,
More informationAnalysis and Synthesis of Weighted-Sum Functions
Analysis and Synthesis of Weighted-Sum Functions Tsutomu Sasao Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 820-8502, Japan April 28, 2005 Abstract A weighted-sum
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 informationChordality and 2-Factors in Tough Graphs
Chordality and -Factors in Tough Graphs D. Bauer 1 G. Y. Katona D. Kratsch 3 H. J. Veldman 4 1 Department of Mathematical Sciences, Stevens Institute of Technology Hooken, NJ 07030, U.S.A. Mathematical
More informationREMARKS ON THE NUMBER OF LOGIC NETWORKS WITH SAME COMPLEXITY DERIVED FROM SPECTRAL TRANSFORM DECISION DIAGRAMS
REMARKS ON THE NUMBER OF LOGIC NETORKS ITH SAME COMPLEXITY DERIVED FROM SPECTRAL TRANSFORM DECISION DIAGRAMS Radomir S. Stanković Mark G. Karpovsky 1 Dept. of Computer Science, Faculty of Electronics,
More informationdoi: /TCAD
doi: 10.1109/TCAD.2006.870407 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 25, NO. 5, MAY 2006 789 Short Papers Analysis and Synthesis of Weighted-Sum Functions Tsutomu
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 informationPseudo-automata for generalized regular expressions
Pseudo-automata for generalized regular expressions B. F. Melnikov A. A. Melnikova Astract In this paper we introduce a new formalism which is intended for representing a special extensions of finite automata.
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 informationThe intersection probability and its properties
The intersection proaility and its properties Faio Cuzzolin INRIA Rhône-Alpes 655 avenue de l Europe, 38334 Montonnot, France Faio.Cuzzolin@inrialpes.fr Astract In this paper we discuss the properties
More informationStability Domain of a Linear Differential Equation with Two Delays
ELSEVIER An International Journal Availale online at www.sciencedirect.com computers &.c,..c. ~--~c,..c.. mathematics with applications Computers and Mathematics with Applications 51 (2006) 153-159 www.elsevier.com/locate/camwa
More informationTHE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY
THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY SHINYA FUJITA AND HENRY LIU Astract The alanced decomposition numer f(g) of a graph G was introduced y Fujita and Nakamigawa [Discr Appl Math,
More informationAnswers to the Exercises -- Chapter 1
Answers to the Exercises -- Chapter 1 SECTION 1 1. a Sentence, official notation ~~~P ~~P ~P P Sentence, informal notation ~Q ~R /\ ~Q ~R Q R c d e Not a sentence; it is impossile to construct "~ " Not
More informationDepartment of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals
Department of Electrical and Computer Engineering Universit of Wisconsin - Madison ECE/C 352 Digital stem Fundamentals Quiz #2 olution Thursda, Octoer 26, 2000, 7:15--8:30PM 1. (15 points) (a). (5 points)
More informationVector Spaces. EXAMPLE: Let R n be the set of all n 1 matrices. x 1 x 2. x n
Vector Spaces DEFINITION: A vector space is a nonempty set V of ojects, called vectors, on which are defined two operations, called addition and multiplication y scalars (real numers), suject to the following
More informationCost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Engineering Letters, 6:, EL_6 ost Reduction in Nearest Neighbour ased Synthesis of Quantum oolean ircuits Mozammel H.. Khan bstract Quantum computer algorithms require an oracle as an integral part. n
More informationLarge-Scale SOP Minimization Using Decomposition and Functional Properties
10.2 Large-Scale SOP Minimization Using Decomposition and Functional Properties Alan Mishchenko Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA
More informationThe Role of the Graphing Calculator in the Qualitative Analysis of Function
The Role of the Graphing Calculator in the Qualitative Analysis of Function Li Hong lihong2209@sina.com Beijing No.22 High School China Astract: This paper focuses on several cases of student s qualitative
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 informationOn the Complexity of Error Detection Functions for Redundant Residue Number Systems
On the Complexity of Error Detection Functions for Redundant Residue Number Systems Tsutomu Sasao 1 and Yukihiro Iguchi 2 1 Dept. of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka
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 informationConcentration of magnetic transitions in dilute magnetic materials
Journal of Physics: Conference Series OPEN ACCESS Concentration of magnetic transitions in dilute magnetic materials To cite this article: V I Beloon et al 04 J. Phys.: Conf. Ser. 490 065 Recent citations
More informationC) 2 D) 4 E) 6. ? A) 0 B) 1 C) 1 D) The limit does not exist.
. The asymptotes of the graph of the parametric equations = t, y = t t + are A) =, y = B) = only C) =, y = D) = only E) =, y =. What are the coordinates of the inflection point on the graph of y = ( +
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 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 informationInstantaneous Measurement of Nonlocal Variables
Instantaneous Measurement of Nonlocal Variales Richard A. Low richard@wentnet.com August 006 Astract We ask the question: is it possile to measure nonlocal properties of a state instantaneously? Relativistic
More informationModule 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers
Module 9: Further Numers and Equations Lesson Aims The aim of this lesson is to enale you to: wor with rational and irrational numers wor with surds to rationalise the denominator when calculating interest,
More information#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES
#A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:
More informationLinear Programming. Our market gardener example had the form: min x. subject to: where: [ acres cabbages acres tomatoes T
Our market gardener eample had the form: min - 900 1500 [ ] suject to: Ñ Ò Ó 1.5 2 â 20 60 á ã Ñ Ò Ó 3 â 60 á ã where: [ acres caages acres tomatoes T ]. We need a more systematic approach to solving these
More informationProperties and Recent Applications in Spectral Graph Theory
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 8 Properties and Recent Applications in Spectral Graph Theory Michelle L. Rittenhouse Virginia Commonwealth
More informationLuis Manuel Santana Gallego 100 Investigation and simulation of the clock skew in modern integrated circuits. Clock Skew Model
Luis Manuel Santana Gallego 100 Appendix 3 Clock Skew Model Xiaohong Jiang and Susumu Horiguchi [JIA-01] 1. Introduction The evolution of VLSI chips toward larger die sizes and faster clock speeds makes
More informationPreprint from Workshop Notes, International Workshop on Logic Synthesis (IWLS 97), Tahoe City, California, May 19-21, 1997
Preprint from Workshop Notes, International Workshop on Logic Synthesis (IWLS 97), Tahoe City, California, May 19-21, 1997 Multi-output Functional Decomposition with Exploitation of Don't Cares Christoph
More informationA Tabu Search Algorithm to Construct BIBDs Using MIP Solvers
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, Septemer 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 179 189 A Tau Search Algorithm to Construct
More informationIsolated Toughness and Existence of [a, b]-factors in Graphs
Isolated Toughness and Existence of [a, ]-factors in Graphs Yinghong Ma 1 and Qinglin Yu 23 1 Department of Computing Science Shandong Normal University, Jinan, Shandong, China 2 Center for Cominatorics,
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 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 informationSchool of Business. Blank Page
Equations 5 The aim of this unit is to equip the learners with the concept of equations. The principal foci of this unit are degree of an equation, inequalities, quadratic equations, simultaneous linear
More informationAn Efficient Heuristic Algorithm for Linear Decomposition of Index Generation Functions
An Efficient Heuristic Algorithm for Linear Decomposition of Index Generation Functions Shinobu Nagayama Tsutomu Sasao Jon T. Butler Dept. of Computer and Network Eng., Hiroshima City University, Hiroshima,
More informationMajority-Based Reversible Logic Gate
Maority-Based Reversible Logic Gate Guowu Yang, William N. N. Hung *, Xiaoyu Song and Mare Perowsi Portland State University, Portland, Oregon, USA ABSTRAT Reversible logic plays an important role in application
More informationDepth versus Breadth in Convolutional Polar Codes
Depth versus Breadth in Convolutional Polar Codes Maxime Tremlay, Benjamin Bourassa and David Poulin,2 Département de physique & Institut quantique, Université de Sherrooke, Sherrooke, Quéec, Canada JK
More informationDeterminants of generalized binary band matrices
Determinants of generalized inary and matrices Dmitry Efimov arxiv:17005655v1 [mathra] 18 Fe 017 Department of Mathematics, Komi Science Centre UrD RAS, Syktyvkar, Russia Astract Under inary matrices we
More informationAn Exact Optimization Algorithm for Linear Decomposition of Index Generation Functions
An Exact Optimization Algorithm for Linear Decomposition of Index Generation Functions Shinobu Nagayama Tsutomu Sasao Jon T. Butler Dept. of Computer and Network Eng., Hiroshima City University, Hiroshima,
More informationExact Free Vibration of Webs Moving Axially at High Speed
Eact Free Viration of Wes Moving Aially at High Speed S. HATAMI *, M. AZHARI, MM. SAADATPOUR, P. MEMARZADEH *Department of Engineering, Yasouj University, Yasouj Department of Civil Engineering, Isfahan
More informationOn the Independence of the Formal System L *
6 International Journal of Fuzzy Systems, Vol. 4, No., June On the Independence of the Formal System L * Daowu Pei Astract The formal system L * of fuzzy propositional logic has een successfully applied
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 informationDurham Research Online
Durham Research Online Deposited in DRO: 28 Octoer 2009 Version of attached le: Accepted Version Peer-review status of attached le: Peer-reviewed Citation for pulished item: Cereceda, Luis and van den
More informationab is shifted horizontally by h units. ab is shifted vertically by k units.
Algera II Notes Unit Eight: Eponential and Logarithmic Functions Sllaus Ojective: 8. The student will graph logarithmic and eponential functions including ase e. Eponential Function: a, 0, Graph of an
More informationStudent s Name : Class Roll No. ADDRESS: R-1, Opp. Raiway Track, New Corner Glass Building, Zone-2, M.P. NAGAR, Bhopal
fo/u fopkjr Hkh# tu] ugha vkjehks dke] foifr ns[k NksM+s rqjar e/;e eu dj ';kea iq#"k flag ladyi dj] lgrs foifr vusd] ^cuk^ u NksM+s /;s; dks] j?kqcj jk[ks VsdAA jfpr% ekuo /kez izksrk ln~q# Jh jknksm+nklth
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More information8.1. Measurement of the electromotive force of an electrochemical cell
8.. Measurement of the electromotive force of an electrochemical cell Ojectives: Measurement of electromotive forces ( the internal resistances, investigation of the dependence of ) and terminal voltages
More informationA matroid associated with a phylogenetic tree
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:, 014, 41 56 A matroid associated with a phylogenetic tree Andreas W.M. Dress 1 Katharina T. Huer Mike Steel 3 1 CAS-MPG Partner Institute
More informationFast inverse for big numbers: Picarte s iteration
Fast inverse for ig numers: Picarte s iteration Claudio Gutierrez and Mauricio Monsalve Computer Science Department, Universidad de Chile cgutierr,mnmonsal@dcc.uchile.cl Astract. This paper presents an
More informationLogical Function Decomposition Method for Synthesis of Digital Logical System Implemented with Programmable Logic Devices (PLD)
Circuits and Systems, 213, 4, 472-477 Published Online November 213 (http://www.scirp.org/journal/cs) http://d.doi.org/1.4236/cs.213.4762 Logical Function Decomposition Method for Synthesis of Digital
More informationMathematics Background
UNIT OVERVIEW GOALS AND STANDARDS MATHEMATICS BACKGROUND UNIT INTRODUCTION Patterns of Change and Relationships The introduction to this Unit points out to students that throughout their study of Connected
More informationUpper Bounds for Stern s Diatomic Sequence and Related Sequences
Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:
More informationa b a b ab b b b Math 154B Elementary Algebra Spring 2012
Math 154B Elementar Algera Spring 01 Stud Guide for Eam 4 Eam 4 is scheduled for Thursda, Ma rd. You ma use a " 5" note card (oth sides) and a scientific calculator. You are epected to know (or have written
More informationOn LUT Cascade Realizations of FIR Filters
On LUT Cascade Realizations of FIR Filters Tsutomu Sasao 1 Yukihiro Iguchi 2 Takahiro Suzuki 2 1 Kyushu Institute of Technology, Dept. of Comput. Science & Electronics, Iizuka 820-8502, Japan 2 Meiji University,
More informationHigher. Polynomials and Quadratics. Polynomials and Quadratics 1
Higher Mathematics Polnomials and Quadratics Contents Polnomials and Quadratics 1 1 Quadratics EF 1 The Discriminant EF Completing the Square EF Sketching Paraolas EF 7 5 Determining the Equation of a
More informationThe Minimization Method of Boolean Functions in Polynomial Set-theoretical Format
The Minimization Method of Boolean Functions in Polynomial Set-theoretical Format Bohdan Rytsar National University L viv Polytechnic S Bandera Str 12 L viv 79646 Ukraine Rzeszow University Chair of Computer
More informationWEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 129, Numer 1, Pages 145 154 S 0002-9939(00)05731-2 Article electronically pulished on July 27, 2000 WEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)
More informationFinite Automata and Regular Languages (part II)
Finite Automata and Regular Languages (part II) Prof. Dan A. Simovici UMB 1 / 25 Outline 1 Nondeterministic Automata 2 / 25 Definition A nondeterministic finite automaton (ndfa) is a quintuple M = (A,
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 informationSolving Systems of Linear Equations Symbolically
" Solving Systems of Linear Equations Symolically Every day of the year, thousands of airline flights crisscross the United States to connect large and small cities. Each flight follows a plan filed with
More information10 Lorentz Group and Special Relativity
Physics 129 Lecture 16 Caltech, 02/27/18 Reference: Jones, Groups, Representations, and Physics, Chapter 10. 10 Lorentz Group and Special Relativity Special relativity says, physics laws should look the
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLIX. February 4, 2017 Second Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLIX February 4, 2017 Second Round Three Hours 1. What are the last two digits of 2017 2017? Answer: 77. From Round 1, we now that (2017) 4 7 4 1 mod 10. Thus 7
More information5Higher-degree ONLINE PAGE PROOFS. polynomials
5Higher-degree polnomials 5. Kick off with CAS 5.2 Quartic polnomials 5.3 Families of polnomials 5.4 Numerical approimations to roots of polnomial equations 5.5 Review 5. Kick off with CAS Quartic transformations
More informationSynthetic asymptote formula for surface-printed resistor
Synthetic asymptote formula for surface-printed resistor S.-K. Kwok, K.-F. Tsang, Y.L. Chow and K.-L. Wu Astract: To date, the design of surface-printed resistors has utilised the time-consuming moment
More informationThe Airy function is a Fredholm determinant
Journal of Dynamics and Differential Equations manuscript No. (will e inserted y the editor) The Airy function is a Fredholm determinant Govind Menon Received: date / Accepted: date Astract Let G e the
More informationSummation Formulas. Math Review. Let N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S1: factor out constant
Computer Science Dept Va Tech August 005 005 McQuain WD Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant g f g f ) ) ))
More informationLogarithms. For example:
Math Review Summation Formulas Let >, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant ± ± g f g f ) ) )) ) S: separate summed terms C C ) 6 ) ) Computer
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 informationAn Implementation of an Address Generator Using Hash Memories
An Implementation of an Address Generator Using Memories Tsutomu Sasao and Munehiro Matsuura Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 820-8502, Japan Abstract
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 informationGraphs and polynomials
1 1A The inomial theorem 1B Polnomials 1C Division of polnomials 1D Linear graphs 1E Quadratic graphs 1F Cuic graphs 1G Quartic graphs Graphs and polnomials AreAS of STud Graphs of polnomial functions
More informationImplementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes
BCH Codes Wireless Information Transmission System La. Institute of Communications Engineering g National Sun Yat-sen University Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation
More informationTwo-Stage Improved Group Plans for Burr Type XII Distributions
American Journal of Mathematics and Statistics 212, 2(3): 33-39 DOI: 1.5923/j.ajms.21223.4 Two-Stage Improved Group Plans for Burr Type XII Distriutions Muhammad Aslam 1,*, Y. L. Lio 2, Muhammad Azam 1,
More informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More information326 J. Comput. Sci. & Technol., May 2003, Vol.18, No.3 of single-output FPRM functions. The rest of the paper is organized as follows. In Section 2, p
May 2003, Vol.18, No.3, pp.325 331 J. Comput. Sci. & Technol. Power Minimization of FPRM Functions Based on Polarity Conversion XIA YinShui (ΛΠ ) 1, WU XunWei ( Ξ ) 2 and A. E. A. Almaini 1 1 School of
More information(d) none of these. 9. When the curves y log 10 x and y x. x y plane, how many times do they intersect for values
at Solved Paper Leaked Paper No. of Questions : 50 Time : 40 min Each wrong answer carry rd negative mark. irections for Question no. to : nswer the questions independently of each other. NOTE. In the
More informationNOTE. A Note on Fisher's Inequality
journal of cominatorial theory, Series A 77, 171176 (1997) article no. TA962729 NOTE A Note on Fisher's Inequality Douglas R. Woodall Department of Mathematics, University of Nottingham, Nottingham NG7
More informationOn the structure of a reversible entanglement generating set for three partite states
On the structure of a reversile entanglement generating set for three partite states A. Acín 1, G. Vidal and J. I. Cirac 3 1 GAP-Optique, University of Geneva, 0, Rue de l École de Médecine, CH-111 Geneva
More informationOBJECTIVE 4 EXPONENTIAL FORM SHAPE OF 5/19/2016. An exponential function is a function of the form. where b > 0 and b 1. Exponential & Log Functions
OBJECTIVE 4 Eponential & Log Functions EXPONENTIAL FORM An eponential function is a function of the form where > 0 and. f ( ) SHAPE OF > increasing 0 < < decreasing PROPERTIES OF THE BASIC EXPONENTIAL
More informationReal option valuation for reserve capacity
Real option valuation for reserve capacity MORIARTY, JM; Palczewski, J doi:10.1016/j.ejor.2016.07.003 For additional information aout this pulication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13838
More informationExpansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2
Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,
More informationPAPER Design Methods of Radix Converters Using Arithmetic Decompositions
IEICE TRANS. INF. & SYST., VOL.E90 D, NO.6 JUNE 2007 905 PAPER Design Methods of Radix Converters Using Arithmetic Decompositions Yukihiro IGUCHI a), Tsutomu SASAO b), and Munehiro MATSUURA c), Members
More information