随着数字电路分析与设计的变量数不断增加,例如,自动测试图象的产生,电路中信号几率的测试,等等,使布尔方程的变量数可达到几十个、几百个、甚至更多,如果再采用简单的代数法、卡诺图法来解布尔方程,显然已经不行了。最近,本人有幸从国外的资料上发现,布尔函数的“与或”(Sum Of Product)表达式,简称SOP式,可以通过逻辑矩阵式来求解(注:这是一种形式上象矩阵,但实质上不是矩阵的式子,在此,暂且称之为逻辑矩阵式)。此式不仅能简洁、有效地解布尔方程,而且更适合于用计算机编程来求解。目前,又发展成先将SOP式转换成“化简的排序与或式”(Reduced Ordered SOP),简称ROSOP As the number of variables in digital circuit analysis and design continues to increase, for example, the generation of automated test images, the testing of signal probabilities in circuits, etc., the number of variables in a Boolean equation can reach tens, hundreds or even more More, if we use simple algebraic method, Karnaugh map method to solve the Boolean equation, apparently already die. Recently, I was fortunate to find out from foreign sources that the Sum of Product expression of a Boolean function, referred to as SOP for short, can be solved by a logical matrix (Note: this is formally like a matrix , But essentially not a matrix of formulas, here, for the time being called the logical matrix). This formula can not only concise and effective solution Boolean equation, but also more suitable for solving with computer programming. At present, it has also been developed into the first SOP-type into “Reduced Ordered SOP”, referred to as ROSOP