Circuit Design from Kronecker Galois Field Decision Diagrams for Multiple-Valued Functions

Authors:
Radomir S. Stankovic;Rolf Drechsler
Affiliations:
-;-
Venue:
ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Year:
1997

Citing 0
Cited 7

Linear Models of Circuits Based on the Multivalued Components

Automation and Remote Control
Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m)

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Fibonacci spectral transforms: calculation, algorithms and circuit realizations

Systems Analysis Modelling Simulation - Special issue: Digital signal processing and control
MODD: A New Decision Diagram and Representation for Multiple Output Binary Functions

Proceedings of the conference on Design, automation and test in Europe - Volume 2
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
XML Framework for Various Types of Decision Diagrams for Discrete Functions

IEICE - Transactions on Information and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we define the Kronecker Galois Field Decision Diagrams (KGFDDs), a generalization of Kronecker Decision Diagrams (KDDs) to the representation of Multiple-Valued (MV) functions. Starting from the Multi-place Decision Diagrams (MDDs) and Galois Field Decision Diagrams (GFDDs) we give a generalization that allows more compact representation with respect to the nodes needed.Based on KGFDDs we present a new method for circuit design for MV circuits. In contrast to previously presented approaches the resulting circuits have only logarithmic (instead of linear) depth.