Sökning: "binary decision diagram"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden binary decision diagram.
1. Advances in Functional Decomposition: Theory and Applications
Sammanfattning : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. LÄS MER
2. Symbolic Supervisory Control of Resource Allocation Systems
Sammanfattning : Supervisory control theory (SCT) is a formal model-based methodology for verification and synthesis of supervisors for discrete event systems (DES). The main goal is to guarantee that the closed-loop system fulfills given specifications. SCT has great promise to assist engineers with the generation of reliable control functions. LÄS MER
3. Voronoi-Based Coding
Sammanfattning : The performance of a digital communication system can generally be improved by increasing the number of variables being jointly coded. In this sense, it is desirable to have, e.g., higher-dimensional quantizers, longer channel codes, and more users in a multiple-access system. LÄS MER
4. Applications of decision diagrams for low power synthesis
Sammanfattning : Power consumption is an important design constraint for circuits used in portable devices. In this thesis an analytic approach to minimize the power dissipation of Binary Decision Diagram (BDD) mapped digital circuits is presented. LÄS MER
5. Low power synthesis of BDD mapped circuits
Sammanfattning : Power consumption is an important design constraint for circuits used in portable devices. In this thesis an analytic approach to minimize the power dissipation of Binary Decision Diagram (BDD) mapped digital circuits is presented. LÄS MER