Show simple item record

dc.contributor.advisorJacob K. White and Taylor Hogan.en_US
dc.contributor.authorMurphy, John R.,M. Eng.Massachusetts Institute of Technology.en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2021-01-06T19:34:35Z
dc.date.available2021-01-06T19:34:35Z
dc.date.copyright2020en_US
dc.date.issued2020en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/129238
dc.descriptionThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020en_US
dc.descriptionCataloged from student-submitted PDF of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 43-44).en_US
dc.description.abstractMy 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.statementofresponsibilityby John R. Murphy.en_US
dc.format.extent51 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT 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.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleNeural network fitness function for optimization-based approaches to PCB design automationen_US
dc.typeThesisen_US
dc.description.degreeM. Eng.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.identifier.oclc1227515700en_US
dc.description.collectionM.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienceen_US
dspace.imported2021-01-06T19:34:34Zen_US
mit.thesis.degreeMasteren_US
mit.thesis.departmentEECSen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record