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. 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
{"_id":"sM4mvhnLsfewPCiMS","bibbaseid":"zachariadis-honig-katsaggelos-sourcefidelityoverfadingchannelsperformanceoferasureandscalablecodes-2008","author_short":["Zachariadis, K.","Honig, M.","Katsaggelos, A."],"bibdata":{"bibtype":"article","type":"article","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. © 2008 IEEE.","author":[{"propositions":[],"lastnames":["Zachariadis"],"firstnames":["Konstantinos"],"suffixes":[]},{"propositions":[],"lastnames":["Honig"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos"],"suffixes":[]}],"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","bibtex":"@article{Konstantinos2005,\nabstract = {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.},\nauthor = {Zachariadis, Konstantinos and Honig, Michael and Katsaggelos, Aggelos},\ndoi = {10.1109/TCOMM.2008.060387},\nissn = {0090-6778},\njournal = {IEEE Transactions on Communications},\nkeywords = {Broadcast channel,Fading channel,Rate distortion,Scalable coding,Source-channel coding},\nmonth = {jul},\nnumber = {7},\npages = {1080--1091},\ntitle = {{Source fidelity over fading channels: performance of erasure and scalable codes}},\nurl = {http://ieeexplore.ieee.org/document/4568449/},\nvolume = {56},\nyear = {2008}\n}\n","author_short":["Zachariadis, K.","Honig, M.","Katsaggelos, A."],"key":"Konstantinos2005","id":"Konstantinos2005","bibbaseid":"zachariadis-honig-katsaggelos-sourcefidelityoverfadingchannelsperformanceoferasureandscalablecodes-2008","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/4568449/"},"keyword":["Broadcast channel","Fading channel","Rate distortion","Scalable coding","Source-channel coding"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":["broadcast channel","fading channel","rate distortion","scalable coding","source-channel coding"],"search_terms":["source","fidelity","over","fading","channels","performance","erasure","scalable","codes","zachariadis","honig","katsaggelos"],"title":"Source fidelity over fading channels: performance of erasure and scalable codes","year":2008}