CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishAbstract—We study three-level implementations where the first two levels represent a standard PLA form with an AND- plane and an OR-plane. This implements a 2m-output SOP. The final stage consists of m two-input programmable LUTs. The PLA outputs are paired so that the LUT outputs implement a set of m given incompletely specified functions (ISFs). Such three-level structures have been studied previously where the final two-input operator was fixed, say an AND or an XOR resulting in an AND-OR-AND implementation or an AND- OR-XOR implementation. By using the LUT effectively, the composition of the AND-plane can be controlled to implement a set of cubes which have the maximum cube sharing. For each output, we characterize the problem of all legal implementations of such a model, by defining Boolean relations that capture all the don’t care conditions induced by any LUT logic. The extra LUT level provides a dimension beyond simple phase assignment. We performed experiments using a Boolean relation minimizer to compare such realizations vs. SOP forms and three-level forms, comparing areas and delays. To approximate the possible sharing in the AND plane, we mapped the 2-m PLA logic using SIS. We focused on two-input Boolean functions not captured by AND- OR-AND or AND-OR-XOR approaches and found good gains in many cases with affordable increases in synthesis runtimes.
| Titolo: | Minimization of incompletely specified functions as three-level logic via Boolean relations |
| Autori interni: | |
| Anno del prodotto: | 2015 |
| Abstract: | Abstract—We study three-level implementations where the first two levels represent a standard PLA form with an AND- plane and an OR-plane. This implements a 2m-output SOP. The final stage consists of m two-input programmable LUTs. The PLA outputs are paired so that the LUT outputs implement a set of m given incompletely specified functions (ISFs). Such three-level structures have been studied previously where the final two-input operator was fixed, say an AND or an XOR resulting in an AND-OR-AND implementation or an AND- OR-XOR implementation. By using the LUT effectively, the composition of the AND-plane can be controlled to implement a set of cubes which have the maximum cube sharing. For each output, we characterize the problem of all legal implementations of such a model, by defining Boolean relations that capture all the don’t care conditions induced by any LUT logic. The extra LUT level provides a dimension beyond simple phase assignment. We performed experiments using a Boolean relation minimizer to compare such realizations vs. SOP forms and three-level forms, comparing areas and delays. To approximate the possible sharing in the AND plane, we mapped the 2-m PLA logic using SIS. We focused on two-input Boolean functions not captured by AND- OR-AND or AND-OR-XOR approaches and found good gains in many cases with affordable increases in synthesis runtimes. |
| Handle: | http://hdl.handle.net/11568/750041 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| MInimization of incompletely specified functions.pdf | Documento in Post-print | NON PUBBLICO - Accesso privato/ristretto | Utenti riconosciuti Richiedi una copia |
Copyright © 2021