Representations of Discrete Functions

Representations of Discrete Functions PDF

Author: Tsutomu Sasao

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 344

ISBN-13: 1461313856

DOWNLOAD EBOOK →

Representations of Discrete Functions is an edited volume containing 13 chapter contributions from leading researchers with a focus on the latest research results. The first three chapters are introductions and contain many illustrations to clarify concepts presented in the text. It is recommended that these chapters are read first. The book then deals with the following topics: binary decision diagrams (BDDs), multi-terminal binary decision diagrams (MTBDDs), edge-valued binary decision diagrams (EVBDDs), functional decision diagrams (FDDs), Kronecker decision diagrams (KDDs), binary moment diagrams (BMDs), spectral transform decision diagrams (STDDs), ternary decision diagrams (TDDs), spectral transformation of logic functions, other transformations oflogic functions, EXOR-based two-level expressions, FPRM minimization with TDDs and MTBDDs, complexity theories on FDDs, multi-level logic synthesis, and complexity of three-level logic networks. Representations of Discrete Functions is designed for CAD researchers and engineers and will also be of interest to computer scientists who are interested in combinatorial problems. Exercises prepared by the editors help make this book useful as a graduate level textbook.

Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques

Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques PDF

Author:

Publisher:

Published: 2002

Total Pages:

ISBN-13:

DOWNLOAD EBOOK →

All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision diagrams. In the Boolean domain, each truth table entry consisting of a Boolean value only provides local information about a function at that point in the Boolean space. Partial binary decision diagrams thus result in the loss of information for a portion of the Boolean space. If the function were represented in the spectral domain however, each integer-valued coefficient would contain some global information about the function. This work also explores spectral representations of discrete functions, including the implementation of a method for transforming circuits from netlist representations directly into spectral decision diagrams.

Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques

Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques PDF

Author: Whitney Jeanne Townsend

Publisher:

Published: 2002

Total Pages:

ISBN-13:

DOWNLOAD EBOOK →

All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision diagrams. In the Boolean domain, each truth table entry consisting of a Boolean value only provides local information about a function at that point in the Boolean space. Partial binary decision diagrams thus result in the loss of information for a portion of the Boolean space. If the function were represented in the spectral domain however, each integer-valued coefficient would contain some global information about the function. This work also explores spectral representations of discrete functions, including the implementation of a method for transforming circuits from netlist representations directly into spectral decision diagrams.

The Representation of Discrete Functions by Decision Trees

The Representation of Discrete Functions by Decision Trees PDF

Author: R. C. Gonzalez

Publisher:

Published: 1982

Total Pages: 133

ISBN-13:

DOWNLOAD EBOOK →

As applications of digital systems continue to expand, the need arises for better methods of analysis of functions of discrete variables. Particularly important is the ability to gauge accurately the difficulty of a problem; this leads to measuring a function's complexity. This in turn requires an implementation-independent model of function evaluation, one that also shows the contribution of individual variables to the function's complexity. One such model, called a decision tree, is introduced; it is essentially a sequential evaluation procedure where, at each step, a variable's value is determined and the next action chosen accordingly. Decision trees have been used in switching circuits, data bases, pattern recognition, machine diagnosis, and remote data processing. The activity of a variable, a new concept that measures the contribution of a variable to the complexity of a function, is defined and its relation to decision trees is described. Based upon these results (which can be generalized to recursive functions and hierarchies of relations), a complexity measure is proposed. The use of that measure and of the concept of activity in testing large systems (where a number of variables may be inaccessible) is then examined, with particular emphasis on continuous checking of systems in operation. (Author).

Representation Theory of Symmetric Groups

Representation Theory of Symmetric Groups PDF

Author: Pierre-Loic Meliot

Publisher: CRC Press

Published: 2017-05-12

Total Pages: 666

ISBN-13: 1498719139

DOWNLOAD EBOOK →

Representation Theory of Symmetric Groups is the most up-to-date abstract algebra book on the subject of symmetric groups and representation theory. Utilizing new research and results, this book can be studied from a combinatorial, algorithmic or algebraic viewpoint. This book is an excellent way of introducing today’s students to representation theory of the symmetric groups, namely classical theory. From there, the book explains how the theory can be extended to other related combinatorial algebras like the Iwahori-Hecke algebra. In a clear and concise manner, the author presents the case that most calculations on symmetric group can be performed by utilizing appropriate algebras of functions. Thus, the book explains how some Hopf algebras (symmetric functions and generalizations) can be used to encode most of the combinatorial properties of the representations of symmetric groups. Overall, the book is an innovative introduction to representation theory of symmetric groups for graduate students and researchers seeking new ways of thought.

Representation of Lie Groups and Special Functions

Representation of Lie Groups and Special Functions PDF

Author: N.Ja. Vilenkin

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 635

ISBN-13: 940113538X

DOWNLOAD EBOOK →

This is the first of three major volumes which present a comprehensive treatment of the theory of the main classes of special functions from the point of view of the theory of group representations. This volume deals with the properties of classical orthogonal polynomials and special functions which are related to representations of groups of matrices of second order and of groups of triangular matrices of third order. This material forms the basis of many results concerning classical special functions such as Bessel, MacDonald, Hankel, Whittaker, hypergeometric, and confluent hypergeometric functions, and different classes of orthogonal polynomials, including those having a discrete variable. Many new results are given. The volume is self-contained, since an introductory section presents basic required material from algebra, topology, functional analysis and group theory. For research mathematicians, physicists and engineers.

Discrete Groups, Expanding Graphs and Invariant Measures

Discrete Groups, Expanding Graphs and Invariant Measures PDF

Author: Alex Lubotzky

Publisher: Springer Science & Business Media

Published: 2010-02-17

Total Pages: 201

ISBN-13: 3034603320

DOWNLOAD EBOOK →

In the last ?fteen years two seemingly unrelated problems, one in computer science and the other in measure theory, were solved by amazingly similar techniques from representation theory and from analytic number theory. One problem is the - plicit construction of expanding graphs («expanders»). These are highly connected sparse graphs whose existence can be easily demonstrated but whose explicit c- struction turns out to be a dif?cult task. Since expanders serve as basic building blocks for various distributed networks, an explicit construction is highly des- able. The other problem is one posed by Ruziewicz about seventy years ago and studied by Banach [Ba]. It asks whether the Lebesgue measure is the only ?nitely additive measure of total measure one, de?ned on the Lebesgue subsets of the n-dimensional sphere and invariant under all rotations. The two problems seem, at ?rst glance, totally unrelated. It is therefore so- what surprising that both problems were solved using similar methods: initially, Kazhdan’s property (T) from representation theory of semi-simple Lie groups was applied in both cases to achieve partial results, and later on, both problems were solved using the (proved) Ramanujan conjecture from the theory of automorphic forms. The fact that representation theory and automorphic forms have anything to do with these problems is a surprise and a hint as well that the two questions are strongly related.

Lanterna Rally - Theme by Grace Themes