摘要
寻找最小代价覆盖是逻辑最小化中的一个重要步骤.由于这是一个NP完全问题,对较大量数据寻找最佳覆盖不实际.本文利用一个随机并行算法,通过将覆盖问题公式化来寻找一个代价函数的全局极值.选择适当的退火策略与参数值即可以得到最佳覆盖结果.所用算法具有较低的时间和空间复杂性,并有高度的并行性.
Finding coverage with minimum cost is an important step in logic minimization. Since it is a Np-complete problem, it is not practical for large input data. In this article, we use a stochastic neural network to find the optimal coverage through formalizing the coverage problem; choosing appropriate annealing schedule and parameters. The algorithm we use has low time and space complexity, and has high parallelism.
出处
《微电子学与计算机》
CSCD
北大核心
1993年第12期4-6,F003,共4页
Microelectronics & Computer
关键词
随机
并行算法
逻辑最小化
Logic minimization
Optimal coverage
Stochastic parallel algorithm
Neural network
