# MODIFIED RECONSTRUCTABILITY ANALYSIS FOR MANY-VALUED FUNCTIONS AND RELATIONS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 MODIIED RECONSTRUCTABILITY ANALYSIS OR MANY-VALUED UNCTIONS AND RELATIONS Anas N. Al-Rabadi (1), and Martin Zwick (2) (1) ECE Department (2) Systems Science Ph.D. State University (1), (2) KEYWORDS: Reconstructability Analysis, Decomposition, Relations, Logic unctions, Many-Valued Logic. ABSTRACT A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do so. Since real-life data are often manyvalued, this new decomposition can be useful for machine learning and data mining. Many-valued MRA can also be applied for the decomposition of relations. 1 INTRODUCTION One general method to understand complex systems is to decompose the system in terms of less complex sub-systems (Klir 1985, Krippendorff 1986). ull decomposition, as opposed to partial decomposition, consists of the determination of the minimal sub-sets of relations that describe the system acceptably. The quality of the decomposition is evaluated by calculating (1) the amount of information (or, conversely, the loss of information, or error) which exists in the decomposed system, and (2) the complexity of the decomposed system. The objective is to decompose the complex system (data) into the least complex and most informative (least error) model. This paper is organized as section 2 presents a background on Reconstructability Analysis, both conventional (CRA) and modified (MRA). Many-valued MRA decomposition is presented in section 3. Conclusions and future work are included in section 4. 2 RECONSTRUCTABILITY ANALYSIS Reconstructability Analysis (RA) is a technique developed in the systems community to decompose relations or distributions involving qualitative variables (Conant 1981, Klir 1985, Krippendorff 1986, Zwick 1999). We are here concerned with lossless decomposition of completely specified set-theoretic (crisp possibilistic) functions and relations. (We do not address information-theoretic, i.e. probabilistic, distributions). In lossless RA decomposition, the aim is to obtain the simplest model of the data which has zero error. The models representing possible decompositions define a graph-based lattice of structures. A model is a structure applied to some data (here a set-theoretic relation). Each model is a set of sub-relations projected from the original relation and represented by look-up tables. New lossless RA-based decomposition, called Modified RA (MRA) decomposition, has been introduced in (Al-Rabadi 2001, Al-Rabadi et al 2002). While CRA decomposes using all values of the function, MRA decomposes using (1) the minimum set of values from which the function can be reconstructed without error, and (2) the simplest model (at the lowest level in the lattice of structures) for each value in the minimal set. The first principle is illustrated for Boolean functions as or every structure in the lattice of structures, decompose the Boolean function for one value only, e.g. for value of 1, into the simplest error-free decomposed structure. One thus obtains the 1-MRA decomposition. This model consists of a set of projections which when intersected yield the original Boolean function. This is illustrated in the following example. 1

2 Example 1. or Boolean function: = + igure 1 illustrates the simplest models obtained using CRA and MRA decompositions. While CRA decomposes for both 0 and 1 values of the Boolean function, MRA decomposes only for value 1, since (x1,x2,x3) can be completely retrieved if one knows the (x1,x2,x3) values for which =1. or Boolean functions there are two advantages of MRA over CRA: (1) MRA decomposition is simpler than CRA decomposition, so the MRA algorithm needs less time and space for its computation, and (2) MRA directly implements the intersection operation with an AND gate in binary logic; consequently MRA decomposition leads directly to a binary circuit and thus can be applied to both machine learning and binary circuit design. On the other hand, the intersection operation in CRA requires ternary logic to accommodate don t cares which are represented in top middle of igure 1 by -. Therefore, CRA has no simple application in binary circuit design. 3 MANY-VALUED MODIIED RECONSTRUCTABILITY ANALYSIS Real-life data are in general many-valued. Consequently, if MRA can decompose relations between many-valued variables it can have practical applications in machine learning and data mining. Many-valued MRA is made up of two main steps which are common to two equivalent (intersection-based and union-based) algorithms: (1) partition the many-valued truth table into sub-tables, each contain only single functional value, and (2) Perform CRA on all sub-tables. igure 2 illustrates the general preprocessing procedure for the two many-valued MRA algorithms, which will be explained in more detail below. Original 3-valued table Step (1): Separate one-valued tables Step (2): CRA decompositions of all one-valued tables Step (3): Application of MRA algorithm This section presents MRA for many-valued functions and relations. Intersection Algorithm Union Algorithm 3.1 GENERAL APPROACH igure 2. Steps for many-valued MRA. Original unction Simplest CRA Model Simplest CRA Circuit Model Modified unction α β γ f f f X 1 X 2 :X 1 X 3 : X 2 X 3 Simplest 1-MRA Model Simplest 1-MRA Circuit Model igure 1. Conventional versus Modified RA decompositions for the Boolean function: = +. δ γ δ f 2 f 3 x 3 γ f X 1 :X 2 X 3 α β γ f1 f 2 f 3 f 3 2

3 or an n -valued completely specified function one needs (n-1) values to define the function. We thus do all n decompositions and use for our MRA model the (n-1) simplest of these. or example, using the lattice-ofstructures, decompose the 3-valued function for each individual value. One then obtains the simplest lossless MRA decomposition for value 0 of the function (denoted as the 0-MRA decomposition), for value 1 (1-MRA decomposition), and for value 2 (2-MRA decomposition). By selecting the simplest two models from these 0-MRA, 1-MRA, and 2-MRA decompositions, one can generate the complete function. In the intersection method, first the CRA decompositions are expanded to include the full set of variable and function values, and these expanded decompositions are then intersected to yield the original table. Equivalently, one can use a union operation to generate the corresponding many-valued MRA as (1) Decompose the original table (function or relation) into sub-tables for each output value: e.g., T = T 0 T 1 T 2 for the corresponding output values O 0, O 1, and O 2 respectively, (2) Do the 3-valued CRA decomposition on each sub-table. Let M j be the decomposition of T j, (3) The reconstructed function or relation (T * ) is the union of all the 1 sub-table decompositions, * T = n M j O j, j = 0 where is the set-theoretic Cartesian product. The union procedure can also be done with (n-1) decompositions. 3.2 COMPLETE EXAMPLES ollowing are two examples which illustrate many-valued Modified Reconstructability Analysis of 3-valued functions. In the first example MRA can decompose the function for only two values, and one has no choice but to use both in the MRA model. In the second example, the function is decomposable for all three of its values, and the two simplest decompositions are chosen to define the model. In discussing the second example, we show that this approach is generalizable to set-theoretic relations, in addition to mappings. Example 2. We will generate the MRA decomposition for the ternary function specified by the following ternary Marquand chart: X 1 X 2 X 3 The following is the intersection algorithm for many-valued MRA for the ternary function in Example 2. Step 1: decompose the ternary chart of the function into three separate tables each for a single function value. This will produce the following three sub-tables. Value Value D0 D1 D2 Step 2: Perform CRA for each sub-table. Step 2a: The simplest error-free 0-MRA decomposition is the original 0 -subtable itself since it is not decomposable. Step 2b: 1-MRA decomposition of D1 is as Value

4 Table 1 Table 2 X 1 X 2 : X 2 X D11 D12 Step 2c: The 2-MRA decomposition of D2 is as Table 3 Table 4 X 1 X 3 : X 2 X D21 D22 THE INTERSECTION ALGORITHM Step 3.1: Select the (3-1=2) simplest error-free decomposed models. In this example these are 1- MRA and 2-MRA decompositions. MRA thus gives the decomposition model of D11:D12:D21:D22 from which the original function can be reconstructed as follows. Step 3.2: Note that, for Tables 1 and 2, the MRA decomposition is for the value 1 of the logic function. Therefore, the existence of the tuples in the decomposed model implies that the function has value 1 for those tuples, and the nonexistence of the tuples in the decomposed model implies that the function does not have value 1 but 0 or 2 for the non-appearing tuples. This is shown in Tables 1 and 2, respectively. Similarly note that, for Tables 3 and 4, the MRA decomposition is for the value 2 of the logic function. Therefore, the existence of the tuples in the decomposed model implies that the function has value 2 for those tuples, and the nonexistence of the tuples in the decomposed model implies that the function does not have value 2 but 0 or 1 for the non-appearing tuples. This is shown in Tables 3 and 4, respectively. Table 1 Table 2 Table 3 Table 4 X 1 X 2 1 : X 2 X 3 2 X 1 X 3 3 : X 2 X , , , , ,0, , , ,0, ,0, , , ,0, , ,0, , , , ,0, , , ,0, , ,0, ,0, , ,0, ,0, ,0, ,0, ,0, ,0, ,0, , ,0, , ,1 In Tables 1 and 2 (i.e., the decomposition for value 1 of the function), the existence of value 1 (of sub-relations 1 and 2 ) means that the value 1 appeared in the original nondecomposed function for the corresponding tuples that appear in each table, but does not imply that the values 0 or 2 (of sub-relations 1 and 2 ) did not exist in the original nondecomposed function for the same tuples. Therefore 0 and 2 are added to 1 as allowed values. In the remaining tuples, however, only 0 and 2 are allowed since the value 1 did not occur. Similarly, in Tables 3 and 4, the existence of the value 2 (of subrelations 3 and 4 ) means that the value 2 appeared in the original non-decomposed function for the corresponding tuples that appear in each table, but does not imply that values 0 or 1 did not exist in the original nondecomposed function for the same tuples. Therefore 0 and 1 are added to 2 as allowed values. In the remaining tuples, however, only 0 and 1 are allowed since the value 2 did not occur. Set-theoretically, obtaining tables 1, 2, 3, and 4 from tables 1, 2, 3, and 4 is described as Table 1 : (D11 (0,1,2)) (D11 (0,2)) Table 2 : (D12 (0,1,2)) (D12 (0,2)) Table 3 : (D21 (0,1,2)) (D21 (0,1)) Table 4 : (D22 (0,1,2)) (D22 (0,1)) where here means complement. Step 3.3: Tables 1, 2, 3, and 4 are used to obtain the block diagram in igure 3, where the following set-theoretic equations govern the outputs of the levels in the circuit shown in the figure: = = = 3 4 4

5 where 1 is given by Table 1, 2 by Table 2, 3 by Table 3, and 4 by Table 4, respectively. Step 3.1: Using the decomposition model D11:D12:D21:D22 obtain D1 and D2 by standard methods as Table D1 = (D11 x3)(d12 x1) D2 = (D21 x2)(d22 x1) D0 = (D1 D2) Table 2 Table where D1 is the decomposition for function value 1, D2 for function value 2, and x1, x2, and x3 {0,1,2}. Step 3.2: Perform the set-theoretic operations to obtain the total function from the decomposed sub-functions. igure 3. The decomposed structure resulting from the many-valued MRA decomposition. The intermediate sub-functions, 5 and 6 are shown in the following maps, respectively Table ,2 0,2 0, , ,2 0,2 0,2 0,2 0,2 0, ,2 0,2 0, ,2 0,2 0,2 0,2 5 = ,1 0,1 0,1 0,1 0,1 0,1 0,1 0,1 0,1 1 0,1 0,1 2 0,1 0,1 2 0,1 0,1 0,1 2 0,1 2 0,1 0,1 0,1 0, ,1 Note that in igure 3 the intersection blocks in the second level and the intersection block at the third (output) level, are general and do not depend on the function being decomposed. Only the tables at the first level depend upon this function. THE UNION ALGORITHM 6 = 3 4 Steps 1 and 2 are the same as in the intersection algorithm. x1x2x3 = (D1 1) (D2 2) ((D1 D2) (1 2) ) = (D1 1) (D2 2) ((D1 D2) 0) Alternatively, one can use all three decompositions: x1x2x3 = (D0 0) (D1 1) (D2 2) The function value of (x1,x2,x3) is determined by the block diagram of igure 4, where G performs the following operation: = 0 if (x1x2x3) D0 = 1 if (x1x2x3) D1 = 2 if (x1x2x3) D2 x1 x2 x3 igure 4. Block diagram for the union algorithm of MRA of Example 2. Note that the logic function in Example 2 is non-decomposable using CRA. Consequently, as can be seen from this example and analogously to the binary case, the new many-valued MRA is superior to CRA. We now consider an example where CRA does decompose, and also where MRA decomposes for all three values. Example 3. Let us generate the MRA decomposition for the ternary function specified by the following ternary Marquand chart: G 5

6 X 1 X 2 X Step 2b: The 1-MRA decomposition of D1 is as Table 4 Table 5 X 1 X 2 : X D11 D12 Step 2c: The 2-MRA decomposition of D2 is as Utilizing the intersection-based algorithm, one obtains the following results for MRA for the ternary function in Example 3. Step 1: decompose the ternary chart of the function into three separate tables each for a single function value. This will produce the following three sub-tables. Value Value Value D0 D1 D2 Step 2: Perform CRA for each sub-table. Step 2a: The 0-MRA decomposition of D0 is as Table 1 Table 2 Table 3 X 1 X 2 : X 2 X 3 : X 1 X D01 D02 D03 Table 6 Table 7 X 1 X 3 : X 2 X D21 D22 THE INTERSECTION ALGORITHM Step 3.1: Select the two simplest decomposed models, namely the 1-MRA and 2-MRA decompositions. These are at a lower level in the lattice of structures than 0-MRA. Step 3.2: Analogously to Example 2, one obtains the following expanded tables: Table 4 Table 5 Table 6 Table 7 X 1 X 2 1 : X 3 2 X 1 X 3 3 : X 2 X ,2 0 1,0, , , ,0,2 1 1,0, , ,0, ,0,2 2 1,0, , ,0, , , , , , , ,0, ,0, ,0, , ,0, ,0, ,0, ,0, ,0, , , ,1 Set-theoretically, obtaining tables 4, 5, 6, and 7 from tables 4, 5, 6, and 7 is described as Table 4 : (D11 (0,1,2)) (D11 (0,2)) Table 5 : (D12 (0,1,2)) (D12 (0,2)) Table 6 : (D21 (0,1,2)) (D21 (0,1)) Table 7 : (D22 (0,1,2)) (D22 (0,1)) 6

7 Step 3.3: Tables 4, 5, 6, and 7 are used to obtain the block diagram in igure 5, where the following set-theoretic equations govern the outputs of the levels in the circuit shown in the figure: = = = 3 4 where 1 is given by Table 4, 2 by Table 5, 3 by Table 6, and 4 by Table 7, respectively. Table 4 Table 5 Table 6 Table igure 5. The decomposed structure resulting from the many-valued MRA decomposition. The intermediate sub-functions, 5 and 6 are shown in the following maps, respectively. 5 6 THE UNION ALGORITHM Steps 1 and 2 are the same as in the intersection algorithm. Step 3.1: Using the decomposition model D01:D02:D11:D12:D21:D22 obtain D0, D1, and D2 by standard methods as D0 = (D01 x3)(d02 x1)(d03 x2) D1 = (D11 x3)(d12 x1x2) D2 = (D21 x2)(d22 x1) where D0 is the decomposition for function value 0, D1 is for function value 1, D2 for function value 2, and x1, x2, and x3 {0,1,2}. Step 3.2: Perform the set-theoretic operations to obtain the total function from the decomposed sub-functions. This can be done using only two of the three decompositions as in Step (3.2) of the union algorithm in Example 2, or alternatively, one can use all three decompositions as x1x2x3 = (D0 0) (D1 1) (D2 2) The function value of (x1,x2,x3) is determined by the block diagram of igure 6, where G performs the following operation: = 0 if (x1x2x3) D0 = 1 if (x1x2x3) D1 = 2 if (x1x2x3) D ,2 0,2 0, ,2 0,2 0,2 0,2 0,2 0, x1 x2 x3 G 2 0,2 0,2 0, ,2 0,2 0,2 5 = ,1 0,1 0,1 0,1 0,1 0,1 0,1 0,1 0,1 1 0,1 0,1 2 0,1 0,1 2 0,1 0,1 0,1 2 0,1 2 0,1 0,1 0,1 0, ,1 6 = 3 4 igure 6. Block diagram for the union algorithm of MRA of Example 3. The logic function in Example 3 is decomposable using CRA with the lossless CRA model : :. Consequently, unlike the previous example, both many-valued MRA and CRA decompose losslessly. Since both CRA and MRA decompose this function, we would like to be able to compare the complexities of the two decompositions. The complexity measure reported in (Al-Rabadi et al 2002) could be used, but needs to be extended to many-valued functions. 7

8 rom the previous discussion, it follows that the extension of many-valued MRA from functions to relations is trivial. One just performs the union algorithm using all n decompositions, e.g., for three values (D0 0) (D1 1) (D2 2). 4 CONCLUSION A novel many-valued decomposition within the framework of Reconstructability Analysis is presented. In previous work (Al-Rabadi 2001, Al-Rabadi et al 2002) Modified Recontructability Analysis (MRA) was applied to Boolean functions. In this paper, MRA is extended to many-valued logic functions and relations. It has been shown that MRA can decompose many-valued functions when CRA fails to do so. Since real-life data are naturally many-valued, future work will apply manyvalued MRA to real-life data for machine learning, data mining, and data analysis. 5 REERENCES Al-Rabadi, A. N A Novel Reconstructability Analysis or the Decomposition of Boolean unctions. Technical Report #2001/005, Electrical and Computer Engineering Department, Portland State University, Portland, Oregon, 1 st July Al-Rabadi, A. N., M. Zwick, and M. Perkowski A Comparison of Enhanced Reconstructability Analysis and Ashenhurst- Curtis Decomposition of Boolean unctions. Accepted to WOSC/IGSS 2002 Conference. Conant, R Set-Theoretic Structural Modeling, Int. J. General Systems, Vol. 7, pp Zwick, M Control Uniqueness in Reconstructibility Analysis. International Journal of General Systems, 23(2). Zwick, M Wholes and Parts in General Systems Methodology. In: The Character Concept in Evolutionary Biology, edited by G. Wagner, Academic Press. BIOGRAPHY Anas N. Al-Rabadi is currently a Ph.D. candidate in the Electrical and Computer Engineering Department at Portland State University, Portland, Oregon. He received his M.S. in Electrical and Computer Engineering from Portland State University in 1998 in the specialty of Power Electronics and Control Systems Design. His current research includes reconstructability analysis, reversible logic, quantum logic, and logic synthesis. Martin Zwick is a Professor of Systems Science at Portland State University. Prior to taking his current position at PSU, he was a faculty member in the Department of Biophysics and Theoretical Biology at the University of Chicago, where he worked in macromolecular structure and mathematical crystallography. In the 1970 s his interests shifted to systems theory and methodology. Since 1976 he has been on the faculty of the PSU Systems Science Ph.D. Program and during the years he was the program coordinator and then director. His research interests are in discrete multivariate modeling (reconstructability analysis), artificial life and theoretical/computational biology, and systems philosophy. Hurst, S. L Logical Processing of Digital Signals. Crane Russak and Edward Arnold, London and Basel. Klir, G Architecture of Systems Problem Solving. Plenum Press, New York. Klir, G. and M. J. Wierman, Uncertainty- Based Information: Variables of Generalized Information Theory, Physica-Verlag, New York. Krippendorff, K Information Theory: Structural Models for Qualitative Data. Sage Publications, Inc. 8

### Directed Extended Dependency Analysis for Data Mining

Directed Extended Dependency Analysis for Data Mining Thaddeus T. Shannon and Martin Zwick Systems Science Program, Portland State University Abstract: Extended Dependency Analysis (EDA) is a heuristic

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### ON THE USE OF ASHENHURST DECOMPOSITION CHART AS AN ALTERNATIVE TO ALGORITHMIC TECHNIQUES IN THE SYNTHESIS OF MULTIPLEXER-BASED LOGIC CIRCUITS

Nigerian Journal of Technology, Vol. 18, No. 1, September, 1997 OSUAGWU 28 ON THE USE OF ASHENHURST DECOMPOSITION CHART AS AN ALTERNATIVE TO ALGORITHMIC TECHNIQUES IN THE SYNTHESIS OF MULTIPLEXER-BASED

### Points Addressed in this Lecture

Points Addressed in this Lecture Lecture 3: Basic Logic Gates & Boolean Expressions Professor Peter Cheung Department of EEE, Imperial College London (Floyd 3.1-3.5, 4.1) (Tocci 3.1-3.9) What are the basic

### Relational Database Design

Relational Database Design Jan Chomicki University at Buffalo Jan Chomicki () Relational database design 1 / 16 Outline 1 Functional dependencies 2 Normal forms 3 Multivalued dependencies Jan Chomicki

### Database Design and Normalization

Database Design and Normalization CPS352: Database Systems Simon Miner Gordon College Last Revised: 9/27/12 Agenda Check-in Functional Dependencies (continued) Design Project E-R Diagram Presentations

### ENGI 241 Experiment 5 Basic Logic Gates

ENGI 24 Experiment 5 Basic Logic Gates OBJECTIVE This experiment will examine the operation of the AND, NAND, OR, and NOR logic gates and compare the expected outputs to the truth tables for these devices.

### Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is

### Engr354: Digital Logic Circuits

gr354: Digital Logic Circuits Chapter 6: Combinational Blocks Dr Curtis Nelson Chapter 6 Overview In this chapter you will learn about: Commonly used combinational sub-circuits; Multipleers, which can

### Cardinality of Fuzzy Sets: An Overview

Cardinality of Fuzzy Sets: An Overview Mamoni Dhar Asst. Professor, Department Of Mathematics Science College, Kokrajhar-783370, Assam, India mamonidhar@rediffmail.com, mamonidhar@gmail.com Abstract In

### Boolean Network Models

Boolean Network Models 2/5/03 History Kaufmann, 1970s Studied organization and dynamics properties of (N,k) Boolean Networks Found out that highly connected networks behave differently than lowly connected

### Digital Circuits. Frequently Asked Questions

Digital Circuits Frequently Asked Questions Module 1: Digital & Analog Signals 1. What is a signal? Signals carry information and are defined as any physical quantity that varies with time, space, or any

### Introduction Number Systems and Conversion

UNIT 1 Introduction Number Systems and Conversion Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material

### UVA. Union DEPARTMENT OF COMPUTER SCIENCE. Algebra-1

Union Union-compatible - two relations are union-compatible if they have the same # of attributes and each attribute must be from the same domain - to compute R 1 R 2, R 1 and R 2 must be union-compatible

### Hybrid Lossless Compression Method For Binary Images

M.F. TALU AND İ. TÜRKOĞLU/ IU-JEEE Vol. 11(2), (2011), 1399-1405 Hybrid Lossless Compression Method For Binary Images M. Fatih TALU, İbrahim TÜRKOĞLU Inonu University, Dept. of Computer Engineering, Engineering

### 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

### Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course

Session ENG 206-6 Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course Nikunja Swain, Ph.D., PE South Carolina State University swain@scsu.edu Raghu Korrapati,

### Introduction. Logic. Most Difficult Reading Topics. Basic Logic Gates Truth Tables Logical Functions. COMP370 Introduction to Computer Architecture

Introduction LOGIC GATES COMP370 Introduction to Computer Architecture Basic Logic Gates Truth Tables Logical Functions Truth Tables Logical Expression Graphical l Form Most Difficult Reading Topics Logic

### FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA

STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LVI, Number 2, 2011 FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA CYNTHIA VERA GLODEANU Abstract. We compare two methods regarding the factorization

### ECEN 248 Introduction to Digital Systems Design (Spring 2008) (Sections: 501, 502, 503, 507)

ECEN 48 Introduction to Digital Systems Design (Spring 8) (Sections: 5, 5, 5, 57) Pro. Xi Zhang ECE Dept, TAMU, N WERC http://.ece.tamu.edu/~xizhang/ecen48 Chapter 6. Multiplexers -to- multiplexer s s

### FACULTY OF COMPUTER SCIENCE AND ENGINEERING CURRICULUM FOR POSTGRADUATE PROGRAMMES. (Master in Information Technology)

FACULTY OF COMPUTER SCIENCE AND ENGINEERING CURRICULUM FOR POSTGRADUATE PROGRAMMES (Master in Information Technology) MASTER IN INFORMATION TECHNOLOGY (MIT) CURRICULUM 1.1 Introduction This programme is

### Digital Logic Circuits

Digital Logic Circuits Digital describes any system based on discontinuous data or events. Typically digital is computer data or electronic sampling of an analog signal. Computers are digital machines

### Exp. No. (2) Exclusive OR Gate and it's Applications

University of Technology Laser & Optoelectronics Engineering Department Digital Electronics lab. Object Exp. No. (2) Exclusive OR Gate and it's pplications To study the logic function of exclusive OR (OR)

### The Relational Algebra

The Relational Algebra The relational algebra is very important for several reasons: 1. it provides a formal foundation for relational model operations. 2. and perhaps more important, it is used as a basis

### Counters In this lesson, the operation and design of Synchronous Binary Counters will be studied.

Counters In this lesson, the operation and design of Synchronous Binary Counters will be studied. Synchronous Binary Counters (SBC) Description and Operation In its simplest form, a synchronous binary

### Group #6 Sam Drazin (Partner: Brian Grahn) Lucas Blanck, TA

Digital Design Lab EEN 35 Section H Lab # Seven- Segment Display / Sequence Detector Group #6 Sam Drazin (Partner: Brian Grahn) Lucas Blanck, TA University of Miami February, 28 Abstract The purpose of

### Multipliers. Introduction

Multipliers Introduction Multipliers play an important role in today s digital signal processing and various other applications. With advances in technology, many researchers have tried and are trying

### 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor

Chapter 1.10 Logic Gates 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor Microprocessors are the central hardware that runs computers. There are several components that make

### Knowledge Based Descriptive Neural Networks

Knowledge Based Descriptive Neural Networks J. T. Yao Department of Computer Science, University or Regina Regina, Saskachewan, CANADA S4S 0A2 Email: jtyao@cs.uregina.ca Abstract This paper presents a

### Unit 2: Number Systems, Codes and Logic Functions

Unit 2: Number Systems, Codes and Logic Functions Introduction A digital computer manipulates discrete elements of data and that these elements are represented in the binary forms. Operands used for calculations

### ECE 331 Digital System Design

ECE 331 Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #21) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

### PARTIAL LEAST SQUARES IS TO LISREL AS PRINCIPAL COMPONENTS ANALYSIS IS TO COMMON FACTOR ANALYSIS. Wynne W. Chin University of Calgary, CANADA

PARTIAL LEAST SQUARES IS TO LISREL AS PRINCIPAL COMPONENTS ANALYSIS IS TO COMMON FACTOR ANALYSIS. Wynne W. Chin University of Calgary, CANADA ABSTRACT The decision of whether to use PLS instead of a covariance

### Design and Implementation of Boolean Functions using Multiplexer and also using Shannon Expansion Theorem

Design and Implementation of Boolean Functions using Multiplexer and also using Shannon Expansion Theorem Keywords Kumaresh Rout 1, Srilata Basu 2, Sarita Misra 3 1Professor, Dept. of Electrical & Electronics

### MODULE 11- DESIGN OF SYNCHRONOUS SEQUENTIAL COUNTERS AND STATE MACHINES

Introduction to Digital Electronics Module 11: Design of Sequential Counters and State Machines 1 MODULE 11- DESIGN OF SYNCHRONOUS SEQUENTIAL COUNTERS AND STATE MACHINES OVERVIEW: A synchronous sequential

### CS143 Notes: Normalization Theory

CS143 Notes: Normalization Theory Book Chapters (4th) Chapters 7.1-6, 7.8, 7.10 (5th) Chapters 7.1-6, 7.8 (6th) Chapters 8.1-6, 8.8 INTRODUCTION Main question How do we design good tables for a relational

### Combinational Circuits (Part II) Notes

Combinational Circuits (Part II) Notes This part of combinational circuits consists of the class of circuits based on data transmission and code converters. These circuits are multiplexers, de multiplexers,

### The Entity Relationship Model and Database Design

The Entity Relationship Model and Database Design CPS352: Database Systems Simon Miner Gordon College Last Revised: 9/20/12 Agenda Check-in The Entity Relationship Model Group Exercise Database Design

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

### Linear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:

Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrix-vector notation as 4 {{ A x x x {{ x = 6 {{ b General

### Introduction Decomposition Simple Synthesis Bernstein Synthesis and Beyond. 6. Normalization. Stéphane Bressan. January 28, 2015

6. Normalization Stéphane Bressan January 28, 2015 1 / 42 This lecture is based on material by Professor Ling Tok Wang. CS 4221: Database Design The Relational Model Ling Tok Wang National University of

### Most decoders accept an input code and produce a HIGH ( or a LOW) at one and only one output line. In otherworlds, a decoder identifies, recognizes,

Encoders Encoder An encoder is a combinational logic circuit that essentially performs a reverse of decoder functions. An encoder accepts an active level on one of its inputs, representing digit, such

### imtech Curriculum Presentation

imtech Curriculum Presentation Effective from Batch 2015 Onwards April, 2015 Course Structure Every course has a fixed number of credits associated with it (e.g., 4 credits) One has to earn 200 credits

### Chapter 12. Algorithmic State Machine

Chapter 12 Algorithmic State Machine 12.0 Introduction In Chapter 10, we introduced two models of synchronous sequential network, which are Mealy and Moore machines. In this chapter, we would like to introduce

### Distributed Database Design

Distributed Database Design Distributed Database Design Conceptual design What can be distributed Design patterns(top-down, Bottom-up) Technical design Fragmentation Allocation and replication of fragments,

### Do not open this examination paper until instructed to do so. Section A: answer all the questions. Section B: answer all the questions.

N10/5/COMSC/HP1/ENG/TZ0/XX 88107011 Computer science HIGHER level Paper 1 Tuesday 16 November 2010 (afternoon) 2 hours 15 minutes INSTRUCTIONS TO CANDIDATES Do not open this examination paper until instructed

### Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

### Clicker Question. Theorems/Proofs and Computational Problems/Algorithms MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Tuesday, 1/21/14 General course Information Sets Reading: [J] 1.1 Optional: [H] 1.1-1.7 Exercises: Do before next class; not to hand in [J] pp. 12-14:

### UNIT - II LOGIC GATES AND GATES CLASSIFICATION

UNIT - II Logic Gates: Gates Classifications: Basic Gates (AND, OR, NOT), Universal Gates (NAND, NOR), Exclusive Gates (XOR, XNOR)(except circuit diagram) Logic Symbols, Logic Operators, Logical expression

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### CHAPTER 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS

CHAPTER 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS This chapter in the book includes: Objectives Study Guide 13.1 A Sequential Parity Checker 13.2 Analysis by Signal Tracing and Timing Charts 13.3 State

### Introduction to Fuzzy Control

Introduction to Fuzzy Control Marcelo Godoy Simoes Colorado School of Mines Engineering Division 1610 Illinois Street Golden, Colorado 80401-1887 USA Abstract In the last few years the applications of

### Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

### Basics of Digital Logic Design

CSE 675.2: Introduction to Computer Architecture Basics of Digital Logic Design Presentation D Study: B., B2, B.3 Slides by Gojko Babi From transistors to chips Chips from the bottom up: Basic building

### ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013

Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm

### Fuzzy Priority CPU Scheduling Algorithm

www.ijcsi.org 386 Fuzzy CPU Scheduling Algorithm Bashir Alam 1, M.N. Doja 1, R. Biswas 3, M. Alam 4 1 Department of Computer Engineering, Jamia Millia Islamia 2 Department of Computer Engineering, Jamia

### A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp

### Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

### VLSI Architecture for Efficient Lifting-Based Forward and Inverse DWT

VLSI Architecture for Efficient Lifting-Based Forward and Inverse DWT A. Kishore kumar 1, Dr. M. Satyanarayana 2 Electronics and Communication Engineering Dept., M.V.G.R College of Engineering, Vizianagaram,

### CS231: Computer Architecture I

CS231: Computer Architecture I Spring 2003 January 22, 2003 2000-2003 Howard Huang 1 What is computer architecture about? Computer architecture is the study of building entire computer systems. Processor

### CMPS 10 Winter Homework Assignment 5

CMPS 10 Winter 2011- Homework Assignment 5 Problems: Chapter 4 (p.184): 1abc, 3abcd, 4ab, 5abc, 6, 7, 9abcd, 15abcd, 17, 18, 19, 20 1. Given our discussion of positional numbering systems in Section 4.2.1,

### Threshold Logic. 2.1 Networks of functions

2 Threshold Logic 2. Networks of functions We deal in this chapter with the simplest kind of computing units used to build artificial neural networks. These computing elements are a generalization of the

### Q4. What are data model? Explain the different data model with examples. Q8. Differentiate physical and logical data independence data models.

FAQs Introduction to Database Systems and Design Module 1: Introduction Data, Database, DBMS, DBA Q2. What is a catalogue? Explain the use of it in DBMS. Q3. Differentiate File System approach and Database

### Notes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

### Module 1: Propositional Logic. CPSC 121: Models of Computation. Module 1: Coming up... Module 1: Coming up...

CPSC 121: Models of Computation By the start of the class, you should be able to: Translate back and forth between simple natural language statements and propositional logic. Evaluate the truth of propositional

### Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

### Master s Program in Information Systems

The University of Jordan King Abdullah II School for Information Technology Department of Information Systems Master s Program in Information Systems 2006/2007 Study Plan Master Degree in Information Systems

### University of St. Thomas ENGR 230 ---- Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54

Fall 2005 Instructor Texts University of St. Thomas ENGR 230 ---- Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54 Lab: Section 1: OSS LL14 Tuesday

### Genetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction

Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules

### Chapter 5: Sequential Circuits (LATCHES)

Chapter 5: Sequential Circuits (LATCHES) Latches We focuses on sequential circuits, where we add memory to the hardware that we ve already seen Our schedule will be very similar to before: We first show

### Chapter 4 Boolean Algebra and Logic Simplification

ETEC 23 Programmable Logic Devices Chapter 4 Boolean Algebra and Logic Simplification Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Boolean

### Basics of Digital Logic Design

Basics of Digital Logic Design Dr. Arjan Durresi Louisiana State University Baton Rouge, LA 70810 Durresi@Csc.LSU.Edu LSUEd These slides are available at: http://www.csc.lsu.edu/~durresi/csc3501_07/ Louisiana

### A Little Perspective Combinational Logic Circuits

A Little Perspective Combinational Logic Circuits COMP 251 Computer Organization and Architecture Fall 2009 Motivating Example Recall our machine s architecture: A Simple ALU Consider an ALU that can perform

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### Implementation Modified Counters using Fredkin & Feynman Logic Gates

Journal of Kerbala University, Vol. 6 No.3 Scientific. 28 Implementation Modified Counters using redkin & eynman Logic Gates Hawrra H.Abbas Al-Rubiae Computer engineering. The University of Kerbala Abstract

### Analysis of Binary/Ternary Cardinality Combinations in Entity-Relationship Modeling

Data & Knowledge Engineering, Vol. 19, o. 1(1996), pp. 39-64 Analysis of Binary/Ternary Cardinality Combinations in Entity-Relationship odeling Trevor H. Jones & Il-Yeol Song College of Information Studies

### NOT AND OR XOR NAND NOR

NOT AND OR XOR NAND NOR Expression 1: It is raining today Expression 2: Today is my birthday X Meaning True False It is raining today It is not raining Binary representation of the above: X Meaning 1 It

### CURIE Academy 2014 Design Project: Exploring an Internet of Things

CURIE Academy 2014 Design Project: Exploring an Internet of Things Christopher Batten School of Electrical and Computer Engineering Cornell University http://www.csl.cornell.edu/curie2014 Electrical and

### The start of this unit will be playing the game, BINARY.

EXTENSION BINARY NUMBERS CHALLENGE The start of this unit will be playing the game, BINARY. Question 1 Write down the patterns that you see for each card. Question 2 Starting at 1 and moving up to 15,

### Steps of sequential circuit design (cont'd)

Design of Clocked Synchronous Sequential Circuits Design of a sequential circuit starts with the verbal description of the problem (scenario). Design process is similar to computer programming. First,

### Master Specialization in Knowledge Engineering

Master Specialization in Knowledge Engineering Pavel Kordík, Ph.D. Department of Computer Science Faculty of Information Technology Czech Technical University in Prague Prague, Czech Republic http://www.fit.cvut.cz/en

### A Novel Method to Improve Resolution of Satellite Images Using DWT and Interpolation

A Novel Method to Improve Resolution of Satellite Images Using DWT and Interpolation S.VENKATA RAMANA ¹, S. NARAYANA REDDY ² M.Tech student, Department of ECE, SVU college of Engineering, Tirupati, 517502,

### Examples of Solved Problems for Chapter3,5,6,7,and8

Chapter 3 Examples of Solved Problems for Chapter3,5,6,7,and8 This document presents some typical problems that the student may encounter, and shows how such problems can be solved. Note that the numbering

### Secondary Logic Functions: NAND/NOR/XOR/XNOR/Buffer

OpenStax-CNX module: m46620 1 Secondary Logic Functions: NAND/NOR/XOR/XNOR/Buffer George Self This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 Abstract

### -

FUZZY HRRN CPU SCHEDULING ALGORITHM 1 Bashir Alam, 1 M.N. Doja, 2 R. Biswas, 3 M. Alam 1 Department of Computer Engineering, Jamia Millia Islamia, New Delhi, India 2 Department of Computer Science and

### COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model

COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model The entity-relationship (E-R) model is a a data model in which information stored

### Topics Digital Circuit Design. Chapter 5 Combinational Circuit Design

Topics 2102581 Digital Circuit Design Chapter 5 Combinational Circuit Design Combinational circuit design with gates, MUX, and decoder Combinational circuit design with PLD devices Combinational circuit

### Exploring Computer Science A Freshman Orientation and Exploratory Course

Exploring Computer Science A Freshman Orientation and Exploratory Course Stephen U. Egarievwe and Vivian J. Fielder Center for Internet Based Education and Research Department of Mathematics and Computer

### Module 3 Digital Gates and Combinational Logic

Introduction to Digital Electronics, Module 3: Digital Gates and Combinational Logic 1 Module 3 Digital Gates and Combinational Logic INTRODUCTION: The principles behind digital electronics were developed

### Chapter 4. Computer Arithmetic

Chapter 4 Computer Arithmetic 4.1 Number Systems A number system uses a specific radix (base). Radices that are power of 2 are widely used in digital systems. These radices include binary (base 2), quaternary

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### Chapter 3: Distributed Database Design

Chapter 3: Distributed Database Design Design problem Design strategies(top-down, bottom-up) Fragmentation Allocation and replication of fragments, optimality, heuristics Acknowledgements: I am indebted

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### Algorithms for Advanced Packet Classification with Ternary CAMs

Algorithms for Advanced Packet Classification with Ternary CAMs Karthik Lakshminarayanan UC Berkeley Joint work with Anand Rangarajan and Srinivasan Venkatachary (Cypress Semiconductor) Packet Processing

### 2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

### Poznan University of Technology Faculty of Electrical Engineering

Poznan University of Technology Faculty of Electrical Engineering Contact Person: Pawel Kolwicz Vice-Dean Faculty of Electrical Engineering pawel.kolwicz@put.poznan.pl List of Modules Academic Year: 2015/16

### 1. A Sequential Parity Checker

Chapter 13: Analysis of Clocked Sequential Circuits 1. A Sequential Parity Checker When binary data is transmitted or stored, an extra bit (called a parity bit) is frequently added for purposes of error