Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1995 | Published
Book Section - Chapter Open

Information Theory and Noisy Computation

Abstract

We report on two types of results. The first is a study of the rate of decay of information carried by a signal which is being propagated over a noisy channel. The second is a series of lower bounds on the depth, size, and component reliability of noisy logic circuits which are required to compute some function reliably. The arguments used for the circuit results are information-theoretic, and in particular, the signal decay result is essential to the depth lower bound. Our first result can be viewed as a quantified version of the data processing lemma, for the case of Boolean random variables.

Additional Information

© 1995 IEEE. Date of Current Version: 06 August 2002. Supported by a Canadian International Fellowship and NSF grant CCR 92-01092. Supported in part by an NSF Postdoctoral Fellowship.

Attached Files

Published - EVAisit95.pdf

Files

EVAisit95.pdf
Files (133.4 kB)
Name Size Download all
md5:b59a70874c7d491e6314ecedcb36a680
133.4 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023