{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19282"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19282","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Functional abstraction in switch-level simulation","abstract":"Switch-level simulation has become an indispensable tool in the verification of large MOS circuits. In this dissertation, a new approach to switch-level simulation is proposed. The presented approach is based on the observation that most switch-level phenomena, such as bidirectional signal flow, charge sharing, and charge storage, occur infrequently in a design. The circuit is, therefore, analyzed with functional abstraction algorithms prior to the simulation. The functional abstraction algorithms analyse the circuit and abstract from it a high-level model of its operation. This abstracted model is then used as the basis for the simulation of the circuit. Since the operation of the overall circuit, rather than the full functionality of each individual circuit component is modeled during the simulation, the performance of the simulation is greatly increased. However, the full switch-level behavior is captured by the functional abstraction algorithms, and the accuracy of the simulation is maintained.","abstract_html":"Switch-level simulation has become an indispensable tool in the verification of large MOS circuits. In this dissertation, a new approach to switch-level simulation is proposed. The presented approach is based on the observation that most switch-level phenomena, such as bidirectional signal flow, charge sharing, and charge storage, occur infrequently in a design. The circuit is, therefore, analyzed with functional abstraction algorithms prior to the simulation. The functional abstraction algorithms analyse the circuit and abstract from it a high-level model of its operation. This abstracted model is then used as the basis for the simulation of the circuit. Since the operation of the overall circuit, rather than the full functionality of each individual circuit component is modeled during the simulation, the performance of the simulation is greatly increased. However, the full switch-level behavior is captured by the functional abstraction algorithms, and the accuracy of the simulation is maintained.","abstract_has_math":false,"creators":["Blaauw, David Theodore"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Abraham, Jacob A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:02:40Z","date_published":"2011-05-07T12:02:40Z","updated_at":"2026-07-22T22:25:12Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1992 Blaauw, David Theodore"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9215780","(UMI)AAI9215780"],"render_values":[{"text":"AAI9215780","href":null,"code":true},{"text":"(UMI)AAI9215780","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19282","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Abraham, Jacob A."]},{"key":"dc:creator","label":"Author","values":["Blaauw, David Theodore"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:02:40Z","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":["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 Blaauw, David Theodore"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9215780","(UMI)AAI9215780","http://hdl.handle.net/2142/19282"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Switch-level simulation has become an indispensable tool in the verification of large MOS circuits. In this dissertation, a new approach to switch-level simulation is proposed. The presented approach is based on the observation that most switch-level phenomena, such as bidirectional signal flow, charge sharing, and charge storage, occur infrequently in a design. The circuit is, therefore, analyzed with functional abstraction algorithms prior to the simulation. The functional abstraction algorithms analyse the circuit and abstract from it a high-level model of its operation. This abstracted model is then used as the basis for the simulation of the circuit. Since the operation of the overall circuit, rather than the full functionality of each individual circuit component is modeled during the simulation, the performance of the simulation is greatly increased. However, the full switch-level behavior is captured by the functional abstraction algorithms, and the accuracy of the simulation is maintained.","The functional abstraction uses static circuit analysis and is automatic and transparent to the user. The abstraction algorithms presented in this dissertation cover a number of circuit grain sizes or levels. In order of increasing size, the four analysis levels are: individual circuit nodes, individual transistors, single dc-connected components, and multiple dc-connected components. At the highest level, the abstraction algorithm generates high-level software models for arbitrarily large circuit blocks. These software models are linked with the simulator and executed in an event-driven fashion. The proposed algorithms were implemented in a switch-level simulator called SNEL, and tested for commercial circuits. It was shown that a simulation speed increase of more than one order of magnitude was obtained using the proposed simulation approach.","Made available in DSpace on 2011-05-07T12:02:40Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9215780.pdf: 5364715 bytes, checksum: aa0ca134f48a03f242e664a2355ee21b (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:35:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:14:19-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":["Functional abstraction in switch-level simulation"]}]}],"canonical_facts":{"dc:contributor":["Abraham, Jacob A."],"dc:creator":["Blaauw, David Theodore"],"dc:date":["2011-05-07T12:02:40Z","10000-01-01","1992"],"dc:description":["Switch-level simulation has become an indispensable tool in the verification of large MOS circuits. In this dissertation, a new approach to switch-level simulation is proposed. The presented approach is based on the observation that most switch-level phenomena, such as bidirectional signal flow, charge sharing, and charge storage, occur infrequently in a design. The circuit is, therefore, analyzed with functional abstraction algorithms prior to the simulation. The functional abstraction algorithms analyse the circuit and abstract from it a high-level model of its operation. This abstracted model is then used as the basis for the simulation of the circuit. Since the operation of the overall circuit, rather than the full functionality of each individual circuit component is modeled during the simulation, the performance of the simulation is greatly increased. However, the full switch-level behavior is captured by the functional abstraction algorithms, and the accuracy of the simulation is maintained.","The functional abstraction uses static circuit analysis and is automatic and transparent to the user. The abstraction algorithms presented in this dissertation cover a number of circuit grain sizes or levels. In order of increasing size, the four analysis levels are: individual circuit nodes, individual transistors, single dc-connected components, and multiple dc-connected components. At the highest level, the abstraction algorithm generates high-level software models for arbitrarily large circuit blocks. These software models are linked with the simulator and executed in an event-driven fashion. The proposed algorithms were implemented in a switch-level simulator called SNEL, and tested for commercial circuits. It was shown that a simulation speed increase of more than one order of magnitude was obtained using the proposed simulation approach.","Made available in DSpace on 2011-05-07T12:02:40Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9215780.pdf: 5364715 bytes, checksum: aa0ca134f48a03f242e664a2355ee21b (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:35:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:14:19-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":["AAI9215780","(UMI)AAI9215780","http://hdl.handle.net/2142/19282"],"dc:language":["eng"],"dc:rights":["Copyright 1992 Blaauw, David Theodore"],"dc:subject":["Computer Science"],"dc:title":["Functional abstraction in switch-level simulation"],"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:12Z"}