Multiple-Valued Logic Minimization for PLA Synthesis
Abstract
Multiple-valued logic minimization is an important technique for reducing the area required by a Programmable Logic Array (PLA). This report describes both heuristic and exact algorithms for solving the multiple-valued logic minimization problem. These algorithms have been implemented in a C program called Espresso-MV.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 05, 1986
- Accession Number
- ADA606736
Entities
People
- Richard L. Rudell
Organizations
- University of California, Berkeley