摘要
为了克服布尔可满足性算法在现场可编程门阵列布线中存在的不足,引进了一种在标准对称阵列(隔离岛状)现场可编程门阵列结构下的新型有效布线方法——伪布尔可满足性算法,并结合实例详细地阐述了将其应用于布线的原理及方法,同时采用实际工业电路将布尔可满足性算法与伪布尔可满足性算法作出比较。实验结果显示,伪布尔可满足性算法比布尔可满足性算法在布线时间上减少了10.5%,在稳定性上提高了3.3%。
To overcome shortcomings of the Boolean Satisfiability Algorithm in the Field Programmable Array routing process, a new and efficient routing method, the Pseudo-Boolean Satisfiability Algorithm, has been introduced for a standard symmetrical array （Island-style） Field Programmable Gate Array. The principle and the method of applying this algorithm to routing are also explained by the detailed example. Furthermore, practical industrial circuits are used to compare the effects of the two algorithms. Results indicate that the Pseudo-Boolean Satisfiability Algorithm can save the muting time by 10.5% and improve the stability by 3.3% than the Boolean Satisfiability Algorithm.
出处
《微计算机信息》
2010年第2期125-127,共3页
Control & Automation
