期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Cu导线表面起伏度对其早期失效的影响(英文)
1
作者 汪辉 朱建军 +2 位作者 王国宏 Bruynseraed C Maex K 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2005年第12期2330-2334,共5页
不同化学机械抛光剂使单层大马士革Cu导线表面起伏程度不同.扫描电镜观察到明显的缺陷出现在大起伏的Cu导线表面.这种表面缺陷导致早期失效比率剧增至几乎100%,电迁移寿命猛降至早期失效的量级,失效时间分布从多模变为单模.其相应的失... 不同化学机械抛光剂使单层大马士革Cu导线表面起伏程度不同.扫描电镜观察到明显的缺陷出现在大起伏的Cu导线表面.这种表面缺陷导致早期失效比率剧增至几乎100%,电迁移寿命猛降至早期失效的量级,失效时间分布从多模变为单模.其相应的失效机制激活能为0.74±0.02eV,说明失效主要是由Cu原子沿导线表面扩散引起的.最弱链接近似被用来分析单根Cu导线:Cu导线被适当均分为若干相互串联、失效机制不同的Cu块,任何一个Cu块的失效都会使整根Cu导线失效.分析结果表明,虽然表面缺陷不是最快的失效机制,但大起伏Cu导线的表面缺陷密度是另一种的10倍以上,这是其早期失效比率高和可靠性较低的主要原因. 展开更多
关键词 早期失效 表面缺陷 最弱链接近似
下载PDF
Solving SAT problem by heuristic polarity decision-making algorithm 被引量:3
2
作者 JING MingE ZHOU Dian +2 位作者 TANG PuShan ZHOU XiaoFang ZHANG Hua 《Science in China(Series F)》 2007年第6期915-925,共11页
This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features of the current state-of-the-art SAT solvers, such as fast BCP, clause... This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features of the current state-of-the-art SAT solvers, such as fast BCP, clause recording, restarts, etc. In addition, a preconditioning step that calculates the polarities of variables according to the cover distribution of Karnaugh map is introduced into DPLL procedure, which greatly reduces the number of conflicts in the search process. The proposed approach is implemented as a SAT solver named DiffSat. Experiments show that DiffSat can solve many "real-life" instances in a reasonable time while the best existing SAT solvers, such as Zchaff and MiniSat, cannot. In particular, DiffSat can solve every instance of Bart benchmark suite in less than 0.03 s while Zchaff and MiniSat fail under a 900 s time limit. Furthermore, DiffSat even outperforms the outstanding incomplete algorithm DLM in some instances. 展开更多
关键词 SAT problem DPLL complete algorithm DECISION-MAKING
原文传递
RLC Equivalent Circuit Synthesis Method for Structure-Preserved Reduced-Order Model of Interconnect in VLSI
3
作者 Fan Yang Xuan Zeng +1 位作者 Yangfeng Su Dian Zhou 《Communications in Computational Physics》 SCIE 2008年第2期376-396,共21页
This paper aims to explore RLC equivalent circuit synthesis method forreduced-order models of interconnect circuits obtained by Krylov subspace basedmodel order reduction (MOR) methods. To guarantee pure RLC equivalen... This paper aims to explore RLC equivalent circuit synthesis method forreduced-order models of interconnect circuits obtained by Krylov subspace basedmodel order reduction (MOR) methods. To guarantee pure RLC equivalent circuitscan be synthesized, both the structures of input and output incidence matrices and theblock structure of the circuit matrices should be preserved in the reduced-order models.Block structure preserving MOR methods have been well established. In this paper,we propose an embeddable Input-Output structure Preserving Order Reduction(IOPOR) technique to further preserve the structures of input and output incidencematrices. By combining block structure preserving MOR methods and IOPOR technique,we develop an RLC equivalent circuit synthesis method RLCSYN (RLC SYNthesis).Inline diagonalization and regularization techniques are specifically proposedto enhance the robustness of inductance synthesis. The pure RLC model, high modelingaccuracy, passivity guaranteed property and SPICE simulation robustness makeRLCSYN more applicable in interconnect analysis, either for digital IC design ormixedsignal IC simulation. 展开更多
关键词 Interconnect circuit model order reduction equivalent circuit synthesis.
原文传递
利用正交方法解SAT问题
4
作者 荆明娥 陈更生 +2 位作者 赵长虹 唐璞山 周电 《复旦学报(自然科学版)》 CAS CSCD 北大核心 2008年第6期786-790,共5页
提出了一种解决SAT问题的新算法.该算法首先定义了子句之间的正交关系;然后从消除子句之间的交叠信息出发,利用正交子句的特性,结合有效的简化技术,逐渐将问题简化为一组与原问题完全等价的正交子句组;最后,根据正交子句组对整个赋值空... 提出了一种解决SAT问题的新算法.该算法首先定义了子句之间的正交关系;然后从消除子句之间的交叠信息出发,利用正交子句的特性,结合有效的简化技术,逐渐将问题简化为一组与原问题完全等价的正交子句组;最后,根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足.该算法为SAT问题的解决提供了一个新的思路. 展开更多
关键词 可满足性问题 卡诺图 正交子句 NP完全问题
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部