University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > How Much Energy Is Required to Send One Bit Reliably over the Poisson Channel with Feedback?

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

How Much Energy Is Required to Send One Bit Reliably over the Poisson Channel with Feedback?

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Fogg .

We study the transmission of a single bit over the continuous-time optical Poisson channel with noiseless feedback. We show that the energy required to send the bit reliably is equal, on the average, to half the energy of a photon. We then consider sending one of M messages and show that the required energy is (M-1)/M of the energy of a photon. With the energy of one photon we can thus send as many bits and we want reliably. These results hold irrespective of the intensity of the dark current.

In discussing these results I shall highlight the difference between the concept of the “required energy per bit” and the “required energy to send a single bit”.

I shall assume only a smidgen of Information Theory and only the basic properties of the Poisson and Exponential distributions.

Joint work with Shahab Asoodeh and Ligong Wang

This talk is part of the Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Ray Dolby Centre Small Lecture Theatre Natural Cambridgeshire Engineering Safe AI seminar group

Other talks

Geometry and Generalization: The case of Grokking Online Causal Inference Seminar Title to be confirmed Machine Politics? Computers and AI in the History of Political Thought Group Presentation 4 Grand Rounds - Equine
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity