A MASSIVE PARALLEL COMPUTATION IN BOOLEAN LOGIC

被引：0
|
作者：
MITRA, AK [1 ]
ORTIZ, J [1 ]
机构：
[1] TEXAS TECH UNIV,ACAD COMP SERV,LUBBOCK,TX 79409
来源：
APPLIED MATHEMATICS AND COMPUTATION | 1993年 / 57卷 / 2-3期
关键词：
D O I：
10.1016/0096-3003(93)90143-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A code in MasPar MPL for the computation of the prime implicants and all the minimal sums of a Boolean sum-of-product form has been presented. This is an extension to parallel computation of a previously published serial code in C [3] based on the method of consensus taking.
引用
收藏
页码：131 / 160
页数：30
相关论文
共 50 条
12345