论文部分内容阅读
讨论了可编程逻辑器件 (PLD)可解析性的数学证明 ,并在此基础上给出了一种异步时序型PLD的解析新算法 .理论分析和实验结果证明了该算法的高效性
The mathematic proof of the resolvability of PLD is discussed and a new algorithm for parsing asynchronous PLD is given.The theoretical analysis and experimental results show that the algorithm is efficient