Symbolic prime generation for multiple-valued functions
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors present new techniques based on the implicit representation and generation of primes for multiple-valued functions with sets of primes several orders of magnitude larger than existing methods. The key idea that makes this computation possible is the symbolic representation of multiple-valued cubes in a characteristic function form called the characteristic-cube function. This symbolic representation can be efficiently denoted using a binary decision diagram (BDD), which is known to be a very compact representation for Boolean formulas. Since there is no direct correspondence between the number of elements in a characteristic function and the size of the BDD representation that denotes it, very large sets of primes may be captured symbolically using the characteristic-cube function representation. Functions with other 10/sup 10/ primes have been successfully generated by using the proposed method.<>Keywords
This publication has 5 references indexed in Scilit:
- Implicit and incremental computation of primes and essential primes of Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms for discrete function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiple-Valued Minimization for PLA OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984