{"title":"采用严格数字神经网络自动生成测试模式的神经逆函数","authors":"M. Arai, T. Nakagawa, H. Kitagawa","doi":"10.1109/VTEST.1993.313318","DOIUrl":null,"url":null,"abstract":"Presents a new method using 'k-out-of-n' design rule for neural networks to find out sets of diagnostic patterns to test VLSI circuits. The authors have already introduced a former method using neural logic gate to be mapped into real circuits directly, although the method needs a large number of neurons. In order to reduce the total number of neurons and computing cost, they propose a neural function called NIF, neural inverse function, for ATPG, automatic test pattern generation. A NIF is defined as a Boolean product form of sums. Simulation results of n-bit full-adder circuits show that the computational order of ATPG is approximately O(n/sup 0.5/) in parallel convergence, and O(n/sup 0.9/) in sequential. Compared with the former method, the new method is able to find a set of test patterns about n times faster than the former method, because NIF method needs a small amount of neurons.<<ETX>>","PeriodicalId":283218,"journal":{"name":"Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium","volume":"59 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A neural inverse function for automatic test pattern generation using strictly digital neural networks\",\"authors\":\"M. Arai, T. Nakagawa, H. Kitagawa\",\"doi\":\"10.1109/VTEST.1993.313318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a new method using 'k-out-of-n' design rule for neural networks to find out sets of diagnostic patterns to test VLSI circuits. The authors have already introduced a former method using neural logic gate to be mapped into real circuits directly, although the method needs a large number of neurons. In order to reduce the total number of neurons and computing cost, they propose a neural function called NIF, neural inverse function, for ATPG, automatic test pattern generation. A NIF is defined as a Boolean product form of sums. Simulation results of n-bit full-adder circuits show that the computational order of ATPG is approximately O(n/sup 0.5/) in parallel convergence, and O(n/sup 0.9/) in sequential. Compared with the former method, the new method is able to find a set of test patterns about n times faster than the former method, because NIF method needs a small amount of neurons.<<ETX>>\",\"PeriodicalId\":283218,\"journal\":{\"name\":\"Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium\",\"volume\":\"59 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTEST.1993.313318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTEST.1993.313318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A neural inverse function for automatic test pattern generation using strictly digital neural networks
Presents a new method using 'k-out-of-n' design rule for neural networks to find out sets of diagnostic patterns to test VLSI circuits. The authors have already introduced a former method using neural logic gate to be mapped into real circuits directly, although the method needs a large number of neurons. In order to reduce the total number of neurons and computing cost, they propose a neural function called NIF, neural inverse function, for ATPG, automatic test pattern generation. A NIF is defined as a Boolean product form of sums. Simulation results of n-bit full-adder circuits show that the computational order of ATPG is approximately O(n/sup 0.5/) in parallel convergence, and O(n/sup 0.9/) in sequential. Compared with the former method, the new method is able to find a set of test patterns about n times faster than the former method, because NIF method needs a small amount of neurons.<>