一种将一般组合电路划分为树型电路的方法

S. A. Ali
{"title":"一种将一般组合电路划分为树型电路的方法","authors":"S. A. Ali","doi":"10.1109/SSST.1992.712205","DOIUrl":null,"url":null,"abstract":"This paper examines the impacts of different types of circuit partitioning on reducing the computational complexity for test generation problem which usually grows exponentially with the number of input lines in the given circuit. It will be shown that decomposing a general combinational circuit into its modules (supergates) such that these modules constitute the basic elements of a tree circuit (network) considerably reduces the computational complexity of the testing problem. Toward this goal, a partition algorithm is developed. This algorithm partitions a given circuit into maximal supergates whenever this is possible. Its computational complexity depends linearly on the number of lines and gates of the circuit.","PeriodicalId":359363,"journal":{"name":"The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Partitioning Technique of General Combinational Circuit Into a Tree Type Circuit\",\"authors\":\"S. A. Ali\",\"doi\":\"10.1109/SSST.1992.712205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper examines the impacts of different types of circuit partitioning on reducing the computational complexity for test generation problem which usually grows exponentially with the number of input lines in the given circuit. It will be shown that decomposing a general combinational circuit into its modules (supergates) such that these modules constitute the basic elements of a tree circuit (network) considerably reduces the computational complexity of the testing problem. Toward this goal, a partition algorithm is developed. This algorithm partitions a given circuit into maximal supergates whenever this is possible. Its computational complexity depends linearly on the number of lines and gates of the circuit.\",\"PeriodicalId\":359363,\"journal\":{\"name\":\"The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1992.712205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1992.712205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了不同类型的电路划分对降低测试生成问题的计算复杂度的影响,测试生成问题通常随着给定电路中输入线路的数量呈指数增长。将显示将一般组合电路分解为其模块(超门),使这些模块构成树形电路(网络)的基本元素,从而大大降低了测试问题的计算复杂性。为此,提出了一种分区算法。只要可能,该算法将给定电路划分为最大的超级门。其计算复杂度与电路的线数和门数呈线性关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Partitioning Technique of General Combinational Circuit Into a Tree Type Circuit
This paper examines the impacts of different types of circuit partitioning on reducing the computational complexity for test generation problem which usually grows exponentially with the number of input lines in the given circuit. It will be shown that decomposing a general combinational circuit into its modules (supergates) such that these modules constitute the basic elements of a tree circuit (network) considerably reduces the computational complexity of the testing problem. Toward this goal, a partition algorithm is developed. This algorithm partitions a given circuit into maximal supergates whenever this is possible. Its computational complexity depends linearly on the number of lines and gates of the circuit.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信