ON THE MAXIMUM TOLERABLE NOISE FOR RELIABLE COMPUTATION BY FORMULAS

被引:46
作者
HAJEK, B
WELLER, T
机构
[1] Coordinate Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois, 61801
关键词
COMPUTATION BY UNRELIABLE COMPONENTS; RELIABLE COMPUTING;
D O I
10.1109/18.75261
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is shown that if formulas constructed from error-prone 3-input gates are used to compute Boolean functions, then a per-gate failure probability of 1/6 or more cannot be tolerated. The result is shown to be tight if the per-gate failure probability is constant and precisely known.
引用
收藏
页码:388 / 391
页数:4
相关论文
共 5 条
[1]   RELIABLE COMPUTATION BY NETWORKS IN THE PRESENCE OF NOISE [J].
FEDER, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (03) :569-571
[2]   RELIABLE COMPUTATION BY FORMULAS IN THE PRESENCE OF NOISE [J].
PIPPENGER, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) :194-197
[3]  
PIPPENGER N, 1989, ADV COMPUTING RES, V5, P171
[4]  
Von Neumann J., 1956, AUTOMATA STUDIES, V34, P43
[5]  
[No title captured]