{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21498"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21498","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions","abstract":"In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, producing high quality solutions. We explore the properties of encoding-based (calculated from the encoding values) and synthesis-based (calculated from synthesis results) cost functions. With these functions, the GLS consistently finds the best known encoding solutions with FSMs of less than sixty states and very good assignments for larger benchmarks.","abstract_html":"In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, producing high quality solutions. We explore the properties of encoding-based (calculated from the encoding values) and synthesis-based (calculated from synthesis results) cost functions. With these functions, the GLS consistently finds the best known encoding solutions with FSMs of less than sixty states and very good assignments for larger benchmarks.","abstract_has_math":false,"creators":["Olson, Eric Peter"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kang, Sung Mo"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:10:21Z","date_published":"2011-05-07T13:10:21Z","updated_at":"2026-07-22T22:25:18Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":["eng"],"rights":["Copyright 1995 Olson, Eric Peter"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9702630","9780591089530","AAI9702630"],"render_values":[{"text":"(UMI)AAI9702630","href":null,"code":true},{"text":"9780591089530","href":null,"code":true},{"text":"AAI9702630","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21498","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kang, Sung Mo"]},{"key":"dc:creator","label":"Author","values":["Olson, Eric Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:10:21Z","10000-01-01","1995"]},{"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 1995 Olson, Eric Peter"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9702630","http://hdl.handle.net/2142/21498","9780591089530","AAI9702630"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, producing high quality solutions. We explore the properties of encoding-based (calculated from the encoding values) and synthesis-based (calculated from synthesis results) cost functions. With these functions, the GLS consistently finds the best known encoding solutions with FSMs of less than sixty states and very good assignments for larger benchmarks.","The encoding-based functions reduce the number of literals and/or reduce the transition density of the state bits. The designs produced from these encodings were 11% smaller and consumed 10% less power than the designs from state-of-the-art state assignment tools. The inaccuracy inherent in any encoding-based cost function limits its application. We have overcome such inaccuracy by using cost functions based on actual synthesis. Area, power, and delay estimates are obtained by optimizing and mapping the encoding. The GLS allows synthesis-based cost functions to steer its selection so that the desired qualities of a solution can be preserved. We found empirically that our recombination procedure allowed the GLS to converge upon solutions with desired area, power, or delay characteristics with synthesis-based cost functions. Results for the MCNC benchmarks showed that these encodings produced circuits that were 21% smaller in area and 30% lower in power than those from state-of-the-art encoding tools. Furthermore, the synthesis-based cost functions produce encodings that lead to circuits with 20% less delays than for the state-of-the-art encoding tools.","This dissertation provides an understanding of the relationship between state assignment and synthesis in terms of area, power, and delay. We describe a probabilistic power estimation tool for sequential circuits. We derive an accurate power estimate based on a zero-delay gate model of the design. This tool preserves all spatial and temporal correlations specified in the FSM description and eliminates the effects of reconvergent fanout. This tool is shown to be sufficiently fast enough to be used for cost calculation and accurate for design quality evaluation.","Made available in DSpace on 2011-05-07T13:10:21Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9702630.pdf: 3970380 bytes, checksum: 5603f80f0107e7315bafe36caa16387b (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:51:12Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:28-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":["Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions"]}]}],"canonical_facts":{"dc:contributor":["Kang, Sung Mo"],"dc:creator":["Olson, Eric Peter"],"dc:date":["2011-05-07T13:10:21Z","10000-01-01","1995"],"dc:description":["In this dissertation, we solve the finite state machine (FSM) state assignment problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, producing high quality solutions. We explore the properties of encoding-based (calculated from the encoding values) and synthesis-based (calculated from synthesis results) cost functions. With these functions, the GLS consistently finds the best known encoding solutions with FSMs of less than sixty states and very good assignments for larger benchmarks.","The encoding-based functions reduce the number of literals and/or reduce the transition density of the state bits. The designs produced from these encodings were 11% smaller and consumed 10% less power than the designs from state-of-the-art state assignment tools. The inaccuracy inherent in any encoding-based cost function limits its application. We have overcome such inaccuracy by using cost functions based on actual synthesis. Area, power, and delay estimates are obtained by optimizing and mapping the encoding. The GLS allows synthesis-based cost functions to steer its selection so that the desired qualities of a solution can be preserved. We found empirically that our recombination procedure allowed the GLS to converge upon solutions with desired area, power, or delay characteristics with synthesis-based cost functions. Results for the MCNC benchmarks showed that these encodings produced circuits that were 21% smaller in area and 30% lower in power than those from state-of-the-art encoding tools. Furthermore, the synthesis-based cost functions produce encodings that lead to circuits with 20% less delays than for the state-of-the-art encoding tools.","This dissertation provides an understanding of the relationship between state assignment and synthesis in terms of area, power, and delay. We describe a probabilistic power estimation tool for sequential circuits. We derive an accurate power estimate based on a zero-delay gate model of the design. This tool preserves all spatial and temporal correlations specified in the FSM description and eliminates the effects of reconvergent fanout. This tool is shown to be sufficiently fast enough to be used for cost calculation and accurate for design quality evaluation.","Made available in DSpace on 2011-05-07T13:10:21Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9702630.pdf: 3970380 bytes, checksum: 5603f80f0107e7315bafe36caa16387b (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:51:12Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:28-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":["(UMI)AAI9702630","http://hdl.handle.net/2142/21498","9780591089530","AAI9702630"],"dc:language":["eng"],"dc:rights":["Copyright 1995 Olson, Eric Peter"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions"],"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:18Z"}