{"title":"基于蚁群算法和遗传算法的MCM互连测试生成优化方案","authors":"Chen Lei","doi":"10.1109/ICEPT.2005.1564674","DOIUrl":null,"url":null,"abstract":"The paper presents a hybrid optimization scheme of ant algorithm (AA) and genetic algorithm (GA) for the interconnect test generation problem in multi-chip module (MCM). In this scheme, the AA is employed to generate the initial candidate vectors for the MCM interconnect test generation, where the pheromone updating rule and state transition rule of AA is designed. Then the GA evolves the candidate vectors generated by AA, using a fault simulator to evaluate the fitness of each candidate vector. Various GA parameters are investigated, including selection operator, crossover operator, crossover and mutation rate, as well as number of generation and population size. The international standard MCM circuit was used to verify the scheme. The results indicate that the performance of the scheme in execution time and fault coverage is comparable to other deterministic algorithms","PeriodicalId":234537,"journal":{"name":"2005 6th International Conference on Electronic Packaging Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A MCM Interconnect Test Generation Optimization Scheme Based on Ant Algorithm and Genetic Algorithm\",\"authors\":\"Chen Lei\",\"doi\":\"10.1109/ICEPT.2005.1564674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a hybrid optimization scheme of ant algorithm (AA) and genetic algorithm (GA) for the interconnect test generation problem in multi-chip module (MCM). In this scheme, the AA is employed to generate the initial candidate vectors for the MCM interconnect test generation, where the pheromone updating rule and state transition rule of AA is designed. Then the GA evolves the candidate vectors generated by AA, using a fault simulator to evaluate the fitness of each candidate vector. Various GA parameters are investigated, including selection operator, crossover operator, crossover and mutation rate, as well as number of generation and population size. The international standard MCM circuit was used to verify the scheme. The results indicate that the performance of the scheme in execution time and fault coverage is comparable to other deterministic algorithms\",\"PeriodicalId\":234537,\"journal\":{\"name\":\"2005 6th International Conference on Electronic Packaging Technology\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 6th International Conference on Electronic Packaging Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEPT.2005.1564674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 6th International Conference on Electronic Packaging Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEPT.2005.1564674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A MCM Interconnect Test Generation Optimization Scheme Based on Ant Algorithm and Genetic Algorithm
The paper presents a hybrid optimization scheme of ant algorithm (AA) and genetic algorithm (GA) for the interconnect test generation problem in multi-chip module (MCM). In this scheme, the AA is employed to generate the initial candidate vectors for the MCM interconnect test generation, where the pheromone updating rule and state transition rule of AA is designed. Then the GA evolves the candidate vectors generated by AA, using a fault simulator to evaluate the fitness of each candidate vector. Various GA parameters are investigated, including selection operator, crossover operator, crossover and mutation rate, as well as number of generation and population size. The international standard MCM circuit was used to verify the scheme. The results indicate that the performance of the scheme in execution time and fault coverage is comparable to other deterministic algorithms