Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
On the Minimization of Multiple-Valued Input Binary-Valued Output Functions
ISMVL '04 Proceedings of the 34th International Symposium on Multiple-Valued Logic
Input Variable Assignment and Output Phase Optimization of PLA's
IEEE Transactions on Computers
A Local Selection Algorithm for Switching Function Minimization
IEEE Transactions on Computers
Hi-index | 0.00 |
Local covering technique of Multiple-Valued Input Binary-Valued Output Functions (MVIBVO) is inherently a divide and conquer technique where the minimization process works in 'expansion' and 'selection' phases. In order to get considerably minimized output proper base minterms should be chosen first. In this paper we propose an enhancement of the existing technique that successfully finds out the essential primes with least number of passes. Result of the experiment shows superior result than the existing techniques.