SIGDA newsletter, vol 17, number 3 Most of the work presented pertained to the synthesis and optimization of combinational logic - although two rather provocative papers were presented on the subject of state machine synthesis. It became clear that algebraic methods for synthesis were well understood by most of the groups present. These are methods based purely on the algebraic manipulation of a given representation of a Boolean function. Many of the systems presented employed some form of decomposition and optimization based on algebraic methods. On the other hand, it was equally evident that synthesis methods capable of more fully utilizing the Boolean properties of a function (other than the strictly algebraic ones) were more limited in their scope and theory. Most systems seemed to have some capability for performing Boolean optimization. One system was presented that offered a means of optimizing multi-level combinational logic with the feature that any circuit so optimized could be proven to be 100% testable. However, decomposition methods utilizing the Boolean properties of a function did not appear to be as well understood. Only one paper dealt with this issue in any detail and it appears that this topic will receive increased attention
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/trip-report-for-the-international-workshop-on-logic-synthesis-UAPLE3qJsX
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Trip report for the international workshop on logic synthesis
Borriello, Gaetano
Follow ACM SIGDA Newsletter
, Volume 17 (3)
Association for Computing Machinery – Sep 1, 1987
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
