MODD: A New Decision Diagram and Representation for Multiple Output Binary Functions

Authors:
Abusaleh M. Jabir;Dhiraj K. Pradhan
Affiliations:
-;-
Venue:
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Year:
2004

Citing 4
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Verification of arithmetic circuits with binary moment diagrams

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Circuit Design from Kronecker Galois Field Decision Diagrams for Multiple-Valued Functions

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Mathematical framework for representing discrete functions as word-level polynomials

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop

Equivalence verification of arithmetic datapaths with multiple word-length operands

Proceedings of the conference on Design, automation and test in Europe: Proceedings
An efficient technique for synthesis and optimization of polynomials in GF(2m)

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields

IEEE Transactions on Computers
A Technique for Representing Multiple Output Binary Functions with Applications to Verification and Simulation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new decision diagram (DD), called MODD, for multiple output binary and multiple-valued functions. This DD is canonic and can be made minimal with respect to a given variable order. Unlike other reported DDs, our approach can represent arbitrary combination of bits at the word-level. The preliminary results show that our representation can result in considerable memory saving [1].