Skip to main content
SpringerLink
Log in

Area efficient methods to increase the reliability of combinatorial circuits

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 349))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. R. Brent, H. Kung The Chip Complexity of Binary Arithmetic, J. ACM 28, 1981, pp. 521–534.

    Google Scholar 

  2. P. Berman, J. Simon, Investigations of Fault-Tolerant Networks of Computers, Proc. 20th STOC, 1988, pp. 66–77.

    Google Scholar 

  3. 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 

  4. 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 

  5. P. Gács, Reliable Computation with Cellular Automata, J. Comp. System Sciences 32, 1986, pp. 15–78.

    Google Scholar 

  6. P. Gács, J. Reif, A Simple 3-Dimensional Real-Time Reliable Cellular Array, J. Comp. System Sciences 36,1988, pp. 125–147.

    Google Scholar 

  7. A. Kuznetsov, Information Storage in a Memory Assembled from Unreliable Components, Prob. Inf. Trans. 9, 1973, pp. 254–264.

    Google Scholar 

  8. 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 

  9. N. Pippenger, On Networks of Noisy Gates, Proc. 26th FoCS, 1985, pp. 30–38.

    Google Scholar 

  10. A. Toom, Nonergodic Multidimensional Systems of Automata, Prob. Inf. Trans. 10, 1974, pp. 239–246.

    Google Scholar 

  11. D. Uhlig, On reliable networks from unreliable gates

    Google Scholar 

  12. Valiant, IEEE Tr. Comp. 30, 1981, pp. 135.–140.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Darmstadt, D - 6100, Darmstadt, West-Germany

    Rüdiger Reischuk & Bernd Schmeltz

Authors
  1. Rüdiger Reischuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Schmeltz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reischuk, R., Schmeltz, B. (1989). Area efficient methods to increase the reliability of combinatorial circuits. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028995

Download citation

  • DOI: https://doi.org/10.1007/BFb0028995

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation