Automated logic synthesis
It is unlikely that we will be able to utilize the full potential of VLSI without major improvements in designer productivity. One approach is to design at a higher functional level and to generate acceptable implementations automatically from such functional specifications. Previous attempts at aut...
Gespeichert in:
Veröffentlicht in: | VLSI Engineering 1984-01, p.177-186 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 186 |
---|---|
container_issue | |
container_start_page | 177 |
container_title | VLSI Engineering |
container_volume | |
creator | Darringer, John A. |
description | It is unlikely that we will be able to utilize the full potential of VLSI without major improvements in designer productivity. One approach is to design at a higher functional level and to generate acceptable implementations automatically from such functional specifications. Previous attempts at automatic logic generation have usually produced results that were much more expensive than manual implementation and have relied on exponential 2-level minimization algorithms which will not scale to VLSI designs. We are exploring an approach based on local transformations with nearly linear run times. A system using these ideas has been built and used to synthesize several gate-array chips with encouraging results. This system has been extended to remap implementations to a different technology and to generate alternative PLA and gate networks for different performance requirements. |
doi_str_mv | 10.1007/BFb0043454 |
format | Article |
fullrecord | <record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_BFb0043454</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_BFb0043454</sourcerecordid><originalsourceid>FETCH-LOGICAL-s186t-392a3f61482702f9881f9bf60bba64ec976a832e552362f61a3e111aeedb4c7b3</originalsourceid><addsrcrecordid>eNpFjztPAzEQhJeXxBHS0NGlpDHsevf8KENEACkSDdQn-2KHg5BD8VHw7wkKEtVIM59G-gAuCK8J0d7cziOisNRyAGciTGwc2foQKjJEiln80X6wiKjpGCpk1Mpb4VMYl_K2q5G1rZ2v4HL6NfQfYUjLybpfde2kfG-G11S6cg4nOaxLGv_lCF7md8-zB7V4un-cTReqkDODYq8DZ0PitEWdvXOUfcwGYwxGUuutCY51qmvNRu_AwImIQkrLKK2NPIKr_W_53HabVdo2se_fS0PY_Po2_778Az_4QRg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Automated logic synthesis</title><source>Springer Books</source><creator>Darringer, John A.</creator><contributor>Kunii, Tosiyasu L.</contributor><creatorcontrib>Darringer, John A. ; Kunii, Tosiyasu L.</creatorcontrib><description>It is unlikely that we will be able to utilize the full potential of VLSI without major improvements in designer productivity. One approach is to design at a higher functional level and to generate acceptable implementations automatically from such functional specifications. Previous attempts at automatic logic generation have usually produced results that were much more expensive than manual implementation and have relied on exponential 2-level minimization algorithms which will not scale to VLSI designs. We are exploring an approach based on local transformations with nearly linear run times. A system using these ideas has been built and used to synthesize several gate-array chips with encouraging results. This system has been extended to remap implementations to a different technology and to generate alternative PLA and gate networks for different performance requirements.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 4431700021</identifier><identifier>ISBN: 9784431700029</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 4431368175</identifier><identifier>EISBN: 9784431368175</identifier><identifier>DOI: 10.1007/BFb0043454</identifier><language>eng</language><publisher>Tokyo: Springer Tokyo</publisher><subject>Local Transformation ; Logic Synthesis ; NAND Gate ; Target Technology ; VLSI Design</subject><ispartof>VLSI Engineering, 1984-01, p.177-186</ispartof><rights>Springer-Verlag Berlin Heidelberg 1984</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0043454$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0043454$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>779,780,784,793,27924,38254,41441,42510</link.rule.ids></links><search><contributor>Kunii, Tosiyasu L.</contributor><creatorcontrib>Darringer, John A.</creatorcontrib><title>Automated logic synthesis</title><title>VLSI Engineering</title><description>It is unlikely that we will be able to utilize the full potential of VLSI without major improvements in designer productivity. One approach is to design at a higher functional level and to generate acceptable implementations automatically from such functional specifications. Previous attempts at automatic logic generation have usually produced results that were much more expensive than manual implementation and have relied on exponential 2-level minimization algorithms which will not scale to VLSI designs. We are exploring an approach based on local transformations with nearly linear run times. A system using these ideas has been built and used to synthesize several gate-array chips with encouraging results. This system has been extended to remap implementations to a different technology and to generate alternative PLA and gate networks for different performance requirements.</description><subject>Local Transformation</subject><subject>Logic Synthesis</subject><subject>NAND Gate</subject><subject>Target Technology</subject><subject>VLSI Design</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>4431700021</isbn><isbn>9784431700029</isbn><isbn>4431368175</isbn><isbn>9784431368175</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1984</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNpFjztPAzEQhJeXxBHS0NGlpDHsevf8KENEACkSDdQn-2KHg5BD8VHw7wkKEtVIM59G-gAuCK8J0d7cziOisNRyAGciTGwc2foQKjJEiln80X6wiKjpGCpk1Mpb4VMYl_K2q5G1rZ2v4HL6NfQfYUjLybpfde2kfG-G11S6cg4nOaxLGv_lCF7md8-zB7V4un-cTReqkDODYq8DZ0PitEWdvXOUfcwGYwxGUuutCY51qmvNRu_AwImIQkrLKK2NPIKr_W_53HabVdo2se_fS0PY_Po2_778Az_4QRg</recordid><startdate>19840101</startdate><enddate>19840101</enddate><creator>Darringer, John A.</creator><general>Springer Tokyo</general><scope/></search><sort><creationdate>19840101</creationdate><title>Automated logic synthesis</title><author>Darringer, John A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-s186t-392a3f61482702f9881f9bf60bba64ec976a832e552362f61a3e111aeedb4c7b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1984</creationdate><topic>Local Transformation</topic><topic>Logic Synthesis</topic><topic>NAND Gate</topic><topic>Target Technology</topic><topic>VLSI Design</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Darringer, John A.</creatorcontrib><jtitle>VLSI Engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Darringer, John A.</au><au>Kunii, Tosiyasu L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Automated logic synthesis</atitle><jtitle>VLSI Engineering</jtitle><date>1984-01-01</date><risdate>1984</risdate><spage>177</spage><epage>186</epage><pages>177-186</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>4431700021</isbn><isbn>9784431700029</isbn><eisbn>4431368175</eisbn><eisbn>9784431368175</eisbn><abstract>It is unlikely that we will be able to utilize the full potential of VLSI without major improvements in designer productivity. One approach is to design at a higher functional level and to generate acceptable implementations automatically from such functional specifications. Previous attempts at automatic logic generation have usually produced results that were much more expensive than manual implementation and have relied on exponential 2-level minimization algorithms which will not scale to VLSI designs. We are exploring an approach based on local transformations with nearly linear run times. A system using these ideas has been built and used to synthesize several gate-array chips with encouraging results. This system has been extended to remap implementations to a different technology and to generate alternative PLA and gate networks for different performance requirements.</abstract><cop>Tokyo</cop><pub>Springer Tokyo</pub><doi>10.1007/BFb0043454</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | VLSI Engineering, 1984-01, p.177-186 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_springer_books_10_1007_BFb0043454 |
source | Springer Books |
subjects | Local Transformation Logic Synthesis NAND Gate Target Technology VLSI Design |
title | Automated logic synthesis |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T06%3A50%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Automated%20logic%20synthesis&rft.jtitle=VLSI%20Engineering&rft.au=Darringer,%20John%20A.&rft.date=1984-01-01&rft.spage=177&rft.epage=186&rft.pages=177-186&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=4431700021&rft.isbn_list=9784431700029&rft_id=info:doi/10.1007/BFb0043454&rft_dat=%3Cspringer%3Espringer_books_10_1007_BFb0043454%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=4431368175&rft.eisbn_list=9784431368175&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |