发明申请
- 专利标题: Combinational Equivalence Checking for Threshold Logic Circuits
- 专利标题(中): 组合等价检查阈值逻辑电路
-
申请号: US12401982申请日: 2009-03-11
-
公开(公告)号: US20090235216A1公开(公告)日: 2009-09-17
- 发明人: Tejaswi Gowda , Sarma Vrudhula
- 申请人: Tejaswi Gowda , Sarma Vrudhula
- 申请人地址: US AZ Scottsdale
- 专利权人: Arizona Board of Regents, a body Corporate of the State of Arizona, Acting for and on Behalf of Ariz
- 当前专利权人: Arizona Board of Regents, a body Corporate of the State of Arizona, Acting for and on Behalf of Ariz
- 当前专利权人地址: US AZ Scottsdale
- 主分类号: G06F17/50
- IPC分类号: G06F17/50
摘要:
Aspects of a method and system for combinational equivalence checking for threshold logic circuits are provided. In this regard, one or more inputs may be received at a threshold logic gate. The threshold function of the threshold logic gate may be recursively decomposed into a first function and a second function using cofactors of the threshold function. A Boolean function representation of the threshold logic gate may be generated based on the recursive decomposition of the threshold function. The generated Boolean function representation of the threshold logic gate may be a maximally factored form representation of a minimal sum of products (SOP) for the threshold logic gate. A logical equivalence of the threshold logic gate may be verified with one or more other logic circuits based on the generated Boolean function representation of the threshold logic gate.
公开/授权文献
信息查询