{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19825"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19825","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Logic optimization of MOS networks","abstract":"The logic networks that can be put on a single chip continues to grow in size and complexity. There is thus an increasing need for designers to rely on the assistance of computer-aided design tools to provide a fast design turnaround and reduce design errors. Logic design (or logic synthesis) is one major step in the ASIC VLSI design cycle in which automation is playing an increasingly important role in recent years. In this thesis, we describe an algorithm, SYLON-REDUCE, that can be used in automated logic synthesis tools for the logic optimization of MOS networks.","abstract_html":"The logic networks that can be put on a single chip continues to grow in size and complexity. There is thus an increasing need for designers to rely on the assistance of computer-aided design tools to provide a fast design turnaround and reduce design errors. Logic design (or logic synthesis) is one major step in the ASIC VLSI design cycle in which automation is playing an increasingly important role in recent years. In this thesis, we describe an algorithm, SYLON-REDUCE, that can be used in automated logic synthesis tools for the logic optimization of MOS networks.","abstract_has_math":false,"creators":["Limqueco, Johnson Chan"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Muroga, Saburo"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:19:49Z","date_published":"2011-05-07T12:19:49Z","updated_at":"2026-07-22T22:25:14Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":["eng"],"rights":["Copyright 1992 Limqueco, Johnson Chan"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9236519","(UMI)AAI9236519"],"render_values":[{"text":"AAI9236519","href":null,"code":true},{"text":"(UMI)AAI9236519","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19825","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Muroga, Saburo"]},{"key":"dc:creator","label":"Author","values":["Limqueco, Johnson Chan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:19:49Z","10000-01-01","1992"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1992 Limqueco, Johnson Chan"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9236519","(UMI)AAI9236519","http://hdl.handle.net/2142/19825"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The logic networks that can be put on a single chip continues to grow in size and complexity. There is thus an increasing need for designers to rely on the assistance of computer-aided design tools to provide a fast design turnaround and reduce design errors. Logic design (or logic synthesis) is one major step in the ASIC VLSI design cycle in which automation is playing an increasingly important role in recent years. In this thesis, we describe an algorithm, SYLON-REDUCE, that can be used in automated logic synthesis tools for the logic optimization of MOS networks.","Most existing logic synthesis algorithms divide logic synthesis into a technology-independent logic synthesis and optimization phase and a technology-mapping phase. This, however, may yield suboptimal final networks. In contrast to this two-phase design approach, SYLON-REDUCE uses a technology-specific approach for the logic optimization of multi-level combinational MOS networks. Given an initial MOS network, SYLON-REDUCE resynthesizes each cell in the network and produces an area- or delay-optimized network which contains only cells that satisfy the same technology constraints or belongs to the same technology library as the cells in the initial network. SYLON-REDUCE uses the concept of permissible functions for more effective optimization. Extensive experimental results demonstrate the effectiveness of SYLON-REDUCE, which generally produces better results than other existing algorithms, including those that employ a two-phase design approach.","To make SYLON-REDUCE applicable to a wider range of large, complex networks, we use a windowing scheme for repeated local optimization of these large networks. This scheme also enables the algorithm to optimize the delay of these networks effectively. Experimental results prove this to be a viable approach.","Furthermore, SYLON-REDUCE is useful for further improvement of MOS technology-mapped networks. It will also be particularly useful in cell generation or full custom design environments.","Made available in DSpace on 2011-05-07T12:19:49Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9236519.pdf: 11636844 bytes, checksum: b14d36da35d901c84013bc5747b293cb (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:39:41Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:46-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Logic optimization of MOS networks"]}]}],"canonical_facts":{"dc:contributor":["Muroga, Saburo"],"dc:creator":["Limqueco, Johnson Chan"],"dc:date":["2011-05-07T12:19:49Z","10000-01-01","1992"],"dc:description":["The logic networks that can be put on a single chip continues to grow in size and complexity. There is thus an increasing need for designers to rely on the assistance of computer-aided design tools to provide a fast design turnaround and reduce design errors. Logic design (or logic synthesis) is one major step in the ASIC VLSI design cycle in which automation is playing an increasingly important role in recent years. In this thesis, we describe an algorithm, SYLON-REDUCE, that can be used in automated logic synthesis tools for the logic optimization of MOS networks.","Most existing logic synthesis algorithms divide logic synthesis into a technology-independent logic synthesis and optimization phase and a technology-mapping phase. This, however, may yield suboptimal final networks. In contrast to this two-phase design approach, SYLON-REDUCE uses a technology-specific approach for the logic optimization of multi-level combinational MOS networks. Given an initial MOS network, SYLON-REDUCE resynthesizes each cell in the network and produces an area- or delay-optimized network which contains only cells that satisfy the same technology constraints or belongs to the same technology library as the cells in the initial network. SYLON-REDUCE uses the concept of permissible functions for more effective optimization. Extensive experimental results demonstrate the effectiveness of SYLON-REDUCE, which generally produces better results than other existing algorithms, including those that employ a two-phase design approach.","To make SYLON-REDUCE applicable to a wider range of large, complex networks, we use a windowing scheme for repeated local optimization of these large networks. This scheme also enables the algorithm to optimize the delay of these networks effectively. Experimental results prove this to be a viable approach.","Furthermore, SYLON-REDUCE is useful for further improvement of MOS technology-mapped networks. It will also be particularly useful in cell generation or full custom design environments.","Made available in DSpace on 2011-05-07T12:19:49Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9236519.pdf: 11636844 bytes, checksum: b14d36da35d901c84013bc5747b293cb (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:39:41Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:46-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9236519","(UMI)AAI9236519","http://hdl.handle.net/2142/19825"],"dc:language":["eng"],"dc:rights":["Copyright 1992 Limqueco, Johnson Chan"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Logic optimization of MOS networks"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:14Z"}