Stankovic et al., 1997 - Google Patents
Circuit design from Kronecker Galois field decision diagrams for multiple-valued functionsStankovic et al., 1997
- Document ID
- 13313674812080989000
- Author
- Stankovic R
- Drechsler R
- Publication year
- Publication venue
- Proceedings 1997 27th International Symposium on Multiple-Valued Logic
External Links
Snippet
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 …
- 238000010586 diagram 0 title abstract description 23
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5045—Circuit design
- G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
- G06F17/5036—Computer-aided design using simulation for analog modelling, e.g. for circuits, spice programme, direct methods, relaxation methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K19/00—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
- H03K19/02—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components
- H03K19/173—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components
- H03K19/1733—Controllable logic circuits
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K19/00—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
- H03K19/02—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components
- H03K19/08—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using semiconductor devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K3/00—Circuits for generating electric pulses; Monostable, bistable or multistable circuits
- H03K3/02—Generators characterised by the type of circuit or by the means used for producing pulses
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Stankovic et al. | Circuit design from Kronecker Galois field decision diagrams for multiple-valued functions | |
Stanković et al. | Spectral interpretation of decision diagrams | |
Stanković et al. | Spectral transform decision diagrams | |
Taha | Reversible logic synthesis methodologies with application to quantum computing | |
Zilic et al. | Current-mode CMOS Galois field circuits | |
Falkowski et al. | Classification and properties of fast linearly independent logic transformations | |
Rahardja et al. | Fast linearly independent arithmetic expansions | |
Falkowski et al. | Properties and methods of calculating generalised arithmetic and adding transforms | |
Perkowski et al. | Ordered and shared, linearly-independent, variable-pair decision diagrams | |
Falkowski et al. | An effective computer algorithm for the calculation of disjoint cube representation of boolean functions | |
Perkowski et al. | Efficient Algorithms for Creation of Linearly‐independent Decision Diagrams and their Mapping to Regular Layouts | |
Falkowski et al. | Family of fast transforms over GF (3) logic | |
Rahardja et al. | Polynomial expansions over GF (2) based on fastest transformation | |
Perkowski et al. | A Canonical AND/EXOR Form that includes both the Generalized Reed-Muller Forms and Kronecker Reed-Muller Forms," | |
Falkowski et al. | Calculation of arithmetic spectra from free binary decision diagrams | |
Green et al. | Some polynomial compositions of nonlinear feedback shift registers and their sequence-domain consequences | |
Stankovic et al. | Circuit synthesis from Fibonacci decision diagrams | |
Fu et al. | Properties and relations of quaternary linearly independent helix transformations | |
Falkowski et al. | Fast transforms for multiple-valued input binary output PLI logic | |
Stanković et al. | Spectral transforms calculation through decision diagrams | |
Chrzanawska-Jeske et al. | Pseudo-symmetric functional decision diagrams | |
Bandyopadhyay et al. | Synthesis of ESOP-based reversible logic using negative polarity reed-muller form | |
Stanković et al. | Foundations for applications of Gibbs derivatives in logic design and VLSI | |
Falkowski et al. | Spectral interpretation and applications of decision diagrams | |
Al-Rabadi | Representations, operations, and applications of switching circuits in the reversible and quantum spaces |