{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69525"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69525","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Design of Minimal Programmable Logic Arrays","abstract":"The switching function minimization is very important for optimal and reliable PLA design. A number of different minimization procedures have appeared. However, until recently, the application of these minimization procedures has been limited to functions of a few variables. For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too much memory space. Part I of this thesis proposes a new minimization procedure requiring less computation time and less memory space. Part I also proposes the heuristic procedures for some functions which abolute minimization procedures cannot minimize within reasonable amount of time and memory space.","abstract_html":"The switching function minimization is very important for optimal and reliable PLA design. A number of different minimization procedures have appeared. However, until recently, the application of these minimization procedures has been limited to functions of a few variables. For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too much memory space. Part I of this thesis proposes a new minimization procedure requiring less computation time and less memory space. Part I also proposes the heuristic procedures for some functions which abolute minimization procedures cannot minimize within reasonable amount of time and memory space.","abstract_has_math":false,"creators":["Hong, Sung Je"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:30Z","date_published":"2014-12-15T19:25:30Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8409954"],"render_values":[{"text":"(UMI)AAI8409954","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69525","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Hong, Sung Je"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:30Z","10000-01-01","1983"]},{"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":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69525","(UMI)AAI8409954"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The switching function minimization is very important for optimal and reliable PLA design. A number of different minimization procedures have appeared. However, until recently, the application of these minimization procedures has been limited to functions of a few variables. For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too much memory space. Part I of this thesis proposes a new minimization procedure requiring less computation time and less memory space. Part I also proposes the heuristic procedures for some functions which abolute minimization procedures cannot minimize within reasonable amount of time and memory space.","A decoded-PLA consists of decoders, an AND array, and an OR array. It has been known that decoded-PLA's generally require smaller arrays than normal PLA's. However, no systematic procedure for the design of minimal decoded-PLA's has been known. Only heuristic procedures such as MINI developed by IBM are used for the design of decoded-PLA's, but they cannot guarantee minimality. Part II of this thesis proposes a systematic procedure for the design of minimal decoded-PLA's, where minimality is guaranteed.","For functions with too many terms in their minimal sums, a single PLA scheme is not appropriate because the actual chip size is too big and the speed is too slow. A PLA network, i.e., a multiple PLA scheme, may be used to realize such big functions in an effective manner. Part III of this thesis proposes the partitioned-PLA method, which splits a large single PLA into several small sub-PLA's such that each of them can be realized with reasonable chip size and speed. Part III also proposes several other PLA networks and compares these networks in terms of sizes required for implementing various sample functions.","Made available in DSpace on 2014-12-15T19:25:30Z (GMT). No. of bitstreams: 1 8409954.pdf: 8906233 bytes, checksum: a6edf099ec16b436dc6552ebf42c1abd (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69691 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","321 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."]},{"key":"dc:title","label":"Title","values":["Design of Minimal Programmable Logic Arrays"]}]}],"canonical_facts":{"dc:creator":["Hong, Sung Je"],"dc:date":["2014-12-15T19:25:30Z","10000-01-01","1983"],"dc:description":["The switching function minimization is very important for optimal and reliable PLA design. A number of different minimization procedures have appeared. However, until recently, the application of these minimization procedures has been limited to functions of a few variables. For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too much memory space. Part I of this thesis proposes a new minimization procedure requiring less computation time and less memory space. Part I also proposes the heuristic procedures for some functions which abolute minimization procedures cannot minimize within reasonable amount of time and memory space.","A decoded-PLA consists of decoders, an AND array, and an OR array. It has been known that decoded-PLA's generally require smaller arrays than normal PLA's. However, no systematic procedure for the design of minimal decoded-PLA's has been known. Only heuristic procedures such as MINI developed by IBM are used for the design of decoded-PLA's, but they cannot guarantee minimality. Part II of this thesis proposes a systematic procedure for the design of minimal decoded-PLA's, where minimality is guaranteed.","For functions with too many terms in their minimal sums, a single PLA scheme is not appropriate because the actual chip size is too big and the speed is too slow. A PLA network, i.e., a multiple PLA scheme, may be used to realize such big functions in an effective manner. Part III of this thesis proposes the partitioned-PLA method, which splits a large single PLA into several small sub-PLA's such that each of them can be realized with reasonable chip size and speed. Part III also proposes several other PLA networks and compares these networks in terms of sizes required for implementing various sample functions.","Made available in DSpace on 2014-12-15T19:25:30Z (GMT). No. of bitstreams: 1 8409954.pdf: 8906233 bytes, checksum: a6edf099ec16b436dc6552ebf42c1abd (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69691 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","321 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."],"dc:identifier":["http://hdl.handle.net/2142/69525","(UMI)AAI8409954"],"dc:subject":["Computer Science"],"dc:title":["Design of Minimal Programmable Logic Arrays"],"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:26:01Z"}