|
Published Articles >> Table of Contents >> Abstract
23rd EUROMICRO Conference '97 New Frontiers of Information Technology
p. 31
Fast Minimization Of Multi-Output Boolean Functions In Sum-Of-Condition-Decoders Structures
Sanof Mohamed, COMPASS Design Automation
Marek Perkowski, Portland State University
Lech Jozwiak, Eindhoven University ofTechnology
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EURMIC.1997.617212
Send link to a friend
| Abstract |
|
Abstract| A CDEC gate, or a Condition Decoder, being a product of an AND and NAND of literals, has been introduced in the logic array of the high-speed EPLD CY7C361 chip from Cypress. In this paper we give an algorithm for the minimization of SUM-OF-CDEC (SOC) expressions. This algorithm produced the minimum solutions on all small single-output functions, as required by this chip. We propose also the new concept of a CDEC-PLA and show its advantage over the existing AND/OR PLAs. This structure realizes multi-output SUM-OF-CDEC (SOC) expressions, which generalize the well known SUM-OF-PRODUCT expressions of PLAs. An e.cient heuristic algorithm for the minimization of the multi-output SOC expressions is given. We also propose a new approach for solving covering/factorization problems, called Conditional Graph Coloring. This method is used to minimize SOCs, but can be used in many other applications. Comparison of several versions of the algorithm on benchmarks proves that our fast multi-output algorithm generates high-quality solutions and is especially efficient on strongly unspecifed functions.
|
 Additional Information
|
Citation:
Sanof Mohamed, Marek Perkowski, Lech Jozwiak,
"Fast Minimization Of Multi-Output Boolean Functions In Sum-Of-Condition-Decoders Structures,"
euromicro,
p. 31,
23rd EUROMICRO Conference '97 New Frontiers of Information Technology,
1997
|
|
