Area efficient methods to increase the reliability of circuits

  • Rüdiger Reischuk
  • Bernd Schmeltz
Parallel and Distributed Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 594)


We consider the problem to construct reliable combinatorial and clocked circuits from unreliable basic elements. The main concern in this paper is the question how such fault-tolerance increases the circuit layout. In general it requires at least a logarithmic factor increase of the number of gates. We design area efficient codes for the information transfer within a Boolean circuit. Using such a code two constructions are presented to make circuits reliable without increasing the area by a square of the redundancy overhead for their sizes. The first method splits the circuit into clusters and connects the clusters reliably by groups of wires. As an alternative, a recursive layout stratey for circuits is described which uses special graph separator properties. Under certain conditions it achieves only a constant blowup of the area compared to circuits built from completely reliable elements.

At the end we apply these methods to several well studied Boolean functions. Both constructions achieve constant area redundancy for these examples.


Boolean Function Failure Probability Code Word Combinatorial Circuit Boolean Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A84]
    R. Ahlswede, Improvements of Winograd's Result on Computation in the Presence of Noise, IEEE Tr. on Information Theory 30, 1984, pp. 872–877.CrossRefGoogle Scholar
  2. [BGW88]
    M. Ben-Or, S. Goldwasser, A. Wigderson, Complexity Theory for Noncryptographic Fault-Tolerant Distributed Computations, Proc. 20th STOC, 1988, pp. 1–10.Google Scholar
  3. [BK81]
    R. Brent, H. Kung The Chip Complexity of Binary Arithmetic, J. ACM 28, 1981, pp. 521–534.CrossRefGoogle Scholar
  4. [BS88]
    P. Berman, J. Simon, Investigations of Fault-Tolerant Networks of Computers, Proc. 20th STOC, 1988, pp. 66–77.Google Scholar
  5. [DO77a]
    R. Dobrushin, S. Ortyukov, Lower Bound for the Redundancy of Self-Correcting Arrangements of Unreliable Functional Elements, Prob. Inf. Trans. 13, 1977, pp. 59–65.Google Scholar
  6. [DO77b]
    R. Dobrushin, S. Ortyukov, Upper Bound for the Redundancy of Self-Correcting Arrangements of Unreliable Functional Elements, Prob. Inf. Trans. 13, 1977, pp. 203–218.Google Scholar
  7. [G86]
    P. Gács, Reliable Computation with Cellular Automata, J. Comp. System Sciences 32, 1986, pp. 15–78.CrossRefGoogle Scholar
  8. [G88]
    P. Gács, private communication, 1988.Google Scholar
  9. [G91]
    A. Gál, Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates, Proc. 32. FoCS, 1991, pp. 594–601.Google Scholar
  10. [GR88]
    P. Gács, J. Reif, A Simple 3-Dimensional Real-Time Reliable Cellular Array, J. Comp. System Sciences 36, 1988, pp. 125–147.CrossRefGoogle Scholar
  11. [LT80]
    R. Lipton, Application of a Planar Separator Theorem, SIAM Comp. 9, 1980, pp. 615–627.CrossRefGoogle Scholar
  12. [K73]
    A. Kuznetsov, Information Storage in a Memory Assembled from Unreliable Components, Prob. Inf. Trans. 9, 1973, pp. 254–264.Google Scholar
  13. [N56]
    J. von Neumann, Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components, in C. Shannon, J. McCarthy (Ed.), Automata Studies, Princeton University Press, 1956, pp. 43–98.Google Scholar
  14. [P85]
    N. Pippenger, On Networks of Noisy Gates, Proc. 26th FoCS, 1985, pp. 30–38.Google Scholar
  15. [P89]
    N. Pippenger, Invariance of Complexity Measures for Networks with Unreliable Gates, J. ACM 36, 1989, pp. 531–539.CrossRefGoogle Scholar
  16. [PST91]
    N. Pippenger, G. Stamoulis, J. Tsitsiklis, On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates, IEEE Trans. Infor. Theory 37, 1991, pp. 639–643.CrossRefGoogle Scholar
  17. [RS89]
    R. Reischuk, B. Schmeltz, Area Efficient Methods to Increase the Reliability of Circuits, Proc. 6th STACS, 1989, pp. 314–326.Google Scholar
  18. [RS91]
    R. Reischuk, B. Schmeltz, Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound, Proc. 32. FoCS, 1991, pp. 602–611.Google Scholar
  19. [T74]
    A. Toom, Nonergodic Multidimensional Systems of Automata, Prob. Inf. Trans. 10, 1974, pp. 239–246.Google Scholar
  20. [T89]
    G. Turán Lower Bounds for Synchronous and Planar Circuits, Inform. Proc. Letters 30, 1989 pp. 37–40.CrossRefGoogle Scholar
  21. [U84]
    J. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984.Google Scholar
  22. [U87]
    D. Uhlig, On Reliable Networks from Unreliable Gates, Proc. 6. FCT Conference, 1987, pp. 462–469.Google Scholar
  23. [V81]
    L. Valiant, Universality Considerations in VLSI Circuits, IEEE Tr. on Computers 30, 1981, pp. 135–140.Google Scholar
  24. [W62]
    S. Winograd, Coding for Logical Operations, IBM J. Res. Delelop. 6, 1962, pp. 430–436.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Rüdiger Reischuk
    • 1
  • Bernd Schmeltz
    • 1
  1. 1.Technische Hochschule DarmstadtInstitut für Theoretische InformatikDarmstadt

Personalised recommendations