首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  免费   0篇
一般工业技术   1篇
  1991年   1篇
排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
A symbolic formulation approach is applied to the problem of computing testability features of analog linear networks. The program, SAPTES, obtained by following this approach is presented. The program can be a very useful tool for designers and researchers in the field of linear analog circuits. SAPTES, which is written in LISP and runs on MS-DOS personal computers, is able to compute the testability of linear circuits of rather high complexity (composed of tens of components and nodes). Computational times range from a few tens of seconds to some tens of minutes on medium speed computers. The program is easily transportable to workstations or a mainframe, and, for the mainframe, program performance will considerably increase  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号