摘要
讨论ＰＬＡ优化设计的组合函数分解问题和ＰＬＡ折迭问题，得出对算法有用的两个直接结果。最后将二者联系起来，给出一个综合算法。
In this paper, two problems were discussed. One is the problem of combinatorial function decomposition, the another is PLA folding. Two results about the algorithm were presented in this paper. At last, a synthesis algorithm about the decompostion and folding were presented.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
1996年第4期295-299,共5页
Journal of Computer-Aided Design & Computer Graphics
基金
中国科学院计算技术研究所CAD开放实验室项目
关键词
PLA
优化设计
算法
可编程逻辑器件
folding, folding times, folding pair, simple disjoint decomposition, simple intersection decompostion.
