dc.contributor.advisor | Jacob K. White and Taylor Hogan. | en_US |
dc.contributor.author | Murphy, John R.,M. Eng.Massachusetts Institute of Technology. | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. | en_US |
dc.date.accessioned | 2021-01-06T19:34:35Z | |
dc.date.available | 2021-01-06T19:34:35Z | |
dc.date.copyright | 2020 | en_US |
dc.date.issued | 2020 | en_US |
dc.identifier.uri | https://hdl.handle.net/1721.1/129238 | |
dc.description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020 | en_US |
dc.description | Cataloged from student-submitted PDF of thesis. | en_US |
dc.description | Includes bibliographical references (pages 43-44). | en_US |
dc.description.abstract | My team's goal is to fully automate the Printed Circuit Board (PCB) design process. PCB design can be divided into the placement stage, where circuit components are assigned board locations and orientations, and the routing stage, where circuit pins are electrically connected. The primary objective of the placement stage is to place components in a way that leads to a successful routing stage, which is determined by how many total circuit connections can be satisfied without violating any design rules. My team currently focuses on iterative improvement approaches to PCB placement automation. Algorithms in this category use a placement scoring function to guide the optimization process, and their performance heavily depends on how strongly this scoring function correlates with routability, which is defined as the completion rate that would result if the placement were routed. Existing routability proxies include wire length and connection crossings estimates, however these only correlate roughly with routability. This thesis details the development of a neural network that predicts the routability of a placed design, with the end goal of using it as the scoring function in iterative improvment placement alogirthms. A dataset of over 75,000 placed PCB designs derived from six dierent PCBs was generated to train this network. Experiments were performed for both single board and multi board prediction tasks. Networks were evaluated on their ability to predict both absolute and relative routability, and in both domains improvement over traditional routability proxies is demonstrated. | en_US |
dc.description.statementofresponsibility | by John R. Murphy. | en_US |
dc.format.extent | 51 pages | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
dc.subject | Electrical Engineering and Computer Science. | en_US |
dc.title | Neural network fitness function for optimization-based approaches to PCB design automation | en_US |
dc.type | Thesis | en_US |
dc.description.degree | M. Eng. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.identifier.oclc | 1227515700 | en_US |
dc.description.collection | M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science | en_US |
dspace.imported | 2021-01-06T19:34:34Z | en_US |
mit.thesis.degree | Master | en_US |
mit.thesis.department | EECS | en_US |