On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding

@article{citeulike:2428383, abstract = {Source coding with noiseless feedforward deals with efficient quantization of information sources into indexes, where to reconstruct a source sample, the decoder in addition to this index, has access to all the previous noiseless source samples. This problem may find applications in sensor networks, economics, and control theory. In the first part of this paper, we consider a deterministic block coding scheme for independent and identically distributed (i.i.d.) Gaussian sources. We show that this scheme is asymptotically optimal in terms of its rate-distortion function and the error exponent. In the second part of this paper we consider two-channel multiple description source coding with noiseless feedforward. We consider i.i.d. Gaussian sources and obtain the optimal rate-distortion region. The key result is that there is no penalty to be paid for constraining the descriptions to be mutually refineable. That is when one of the channels is active, the decoder which operates on one of the descriptions achieves the optimal rate-distortion function, and when both channels are active, the joint decoder still attains the optimal rate-distortion function. This implies that for memoryless sources with additive distortion measures, in the case of multiple description source coding, noiseless feedforward provides significant improvements in performance. We then evaluate the optimal multiple description source coding error exponents for the symmetric case}, author = {Pradhan, Sandeep S. }, booktitle = {Information Theory, IEEE Transactions on}, citeulike-article-id = {2428383}, doi = {10.1109/TIT.2006.887496}, journal = {IEEE Transactions on Information Theory}, keywords = {block, channels, codes, coding, combined, description, deterministic, distortion, distributed-gaussian, error, exponent, feedforward, function, gaussian, independent-identically, multiple, noiseless, quantisation, quantization, rate, rate-distortion, scalar, scheme, signal, source, source-channel, sources, theory, two-channel}, month = {January}, number = {1}, pages = {331--349}, posted-at = {2008-02-26 04:24:54}, priority = {2}, title = {On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding}, url = {http://dx.doi.org/10.1109/TIT.2006.887496}, volume = {53}, year = {2007} }

TY - JOUR ID - citeulike:2428383 L3 - citeulike-article-id:2428383 TI - On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding T2 - Information Theory, IEEE Transactions on JF - IEEE Transactions on Information Theory VL - 53 IS - 1 SP - 331 EP - 349 N2 - Source coding with noiseless feedforward deals with efficient quantization of information sources into indexes, where to reconstruct a source sample, the decoder in addition to this index, has access to all the previous noiseless source samples. This problem may find applications in sensor networks, economics, and control theory. In the first part of this paper, we consider a deterministic block coding scheme for independent and identically distributed (i.i.d.) Gaussian sources. We show that this scheme is asymptotically optimal in terms of its rate-distortion function and the error exponent. In the second part of this paper we consider two-channel multiple description source coding with noiseless feedforward. We consider i.i.d. Gaussian sources and obtain the optimal rate-distortion region. The key result is that there is no penalty to be paid for constraining the descriptions to be mutually refineable. That is when one of the channels is active, the decoder which operates on one of the descriptions achieves the optimal rate-distortion function, and when both channels are active, the joint decoder still attains the optimal rate-distortion function. This implies that for memoryless sources with additive distortion measures, in the case of multiple description source coding, noiseless feedforward provides significant improvements in performance. We then evaluate the optimal multiple description source coding error exponents for the symmetric case KW - block KW - channels KW - codes KW - coding KW - combined KW - description KW - deterministic KW - distortion KW - distributed-gaussian KW - error KW - exponent KW - feedforward KW - function KW - gaussian KW - independent-identically KW - multiple KW - noiseless KW - quantisation KW - quantization KW - rate KW - rate-distortion KW - scalar KW - scheme KW - signal KW - source KW - source-channel KW - sources KW - theory KW - two-channel AU - Pradhan, Sandeep PY - 2007/01// UR - http://dx.doi.org/10.1109/TIT.2006.887496 ER -