Source fidelity over fading channels: performance of erasure and scalable codes. Zachariadis, K., Honig, M., & Katsaggelos, A. IEEE Transactions on Communications, 56(7):1080–1091, jul, 2008.
Source fidelity over fading channels: performance of erasure and scalable codes [link]Paper  doi  abstract   bibtex   
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. We first treat an outage as an erasure, and evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We then evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed within a coherence block, and the layers are sequentially decoded. Both the rate and power allocated to each layer are optimized. In addition to analyzing the performance with a finite number of layers, we evaluate the mean distortion at high Signal-to-Noise Ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding, and with much less decoding delay. © 2008 IEEE.
@article{Konstantinos2005,
abstract = {We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. We first treat an outage as an erasure, and evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We then evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed within a coherence block, and the layers are sequentially decoded. Both the rate and power allocated to each layer are optimized. In addition to analyzing the performance with a finite number of layers, we evaluate the mean distortion at high Signal-to-Noise Ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding, and with much less decoding delay. {\textcopyright} 2008 IEEE.},
author = {Zachariadis, Konstantinos and Honig, Michael and Katsaggelos, Aggelos},
doi = {10.1109/TCOMM.2008.060387},
issn = {0090-6778},
journal = {IEEE Transactions on Communications},
keywords = {Broadcast channel,Fading channel,Rate distortion,Scalable coding,Source-channel coding},
month = {jul},
number = {7},
pages = {1080--1091},
title = {{Source fidelity over fading channels: performance of erasure and scalable codes}},
url = {http://ieeexplore.ieee.org/document/4568449/},
volume = {56},
year = {2008}
}

Downloads: 0