Proactive source coding
Authors:
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2213-2217
Abstract
A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical information about which packet is needed at the receiver. There is an associated cost of sending bits at each slot, and the goal is to minimize the expected cost of the communication. A proactive coding scheme is proposed, where the source proactively communicates with the receiver before the receiver requests the message. This way, by designing a cost optimal side information at the receiver, the scheme is able to minimize the expected cost of the communication. Numerical results are provided demonstrating the gains obtained by proactive coding over the conventional coding technique.Keywords
This publication has 6 references indexed in Scilit:
- Proactive resource allocation: Turning predictable behavior into spectral gain2010
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- On source coding with side information at the decoderIEEE Transactions on Information Theory, 1975
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973