TY - JOUR
T1 - Joint source-channel decoding of predictively and nonpredictively encoded sources
T2 - A two-stage estimation approach
AU - Miller, David J.
AU - Carotti, Elias S.G.
AU - Wang, Yu Wei
AU - De Martin, Juan Carlos
PY - 2004/9
Y1 - 2004/9
N2 - A common joint source-channel (JSC) decoder structure for predictively encoded sources involves first forming a JSC decoding estimate of the prediction residual and then feeding this estimate to a standard predictive decoding (synthesis) filter. In this paper, we demonstrate that in a JSC decoding context, use of this standard filter is suboptimal. In place of the standard filter, we choose the synthesis filter coefficients to give a least-squares (LS) estimate of the original source, based on given training data. For first-order differential pulse-code modulation, this yields as much as 0.65-dB gain in reconstructing first-order Gauss-Markov sources. More gains are achieved with modest additional complexity by increasing the filter order. While performance can also be enhanced by increasing the source's Markov model order and/or the decoder's lookup table memory, complexity grows exponentially in these parameters. For both predictive and non-predictive coding, our LS approach offers a strategy for increasing the estimation accuracy of JSC decoders while retaining manageable complexity.
AB - A common joint source-channel (JSC) decoder structure for predictively encoded sources involves first forming a JSC decoding estimate of the prediction residual and then feeding this estimate to a standard predictive decoding (synthesis) filter. In this paper, we demonstrate that in a JSC decoding context, use of this standard filter is suboptimal. In place of the standard filter, we choose the synthesis filter coefficients to give a least-squares (LS) estimate of the original source, based on given training data. For first-order differential pulse-code modulation, this yields as much as 0.65-dB gain in reconstructing first-order Gauss-Markov sources. More gains are achieved with modest additional complexity by increasing the filter order. While performance can also be enhanced by increasing the source's Markov model order and/or the decoder's lookup table memory, complexity grows exponentially in these parameters. For both predictive and non-predictive coding, our LS approach offers a strategy for increasing the estimation accuracy of JSC decoders while retaining manageable complexity.
UR - http://www.scopus.com/inward/record.url?scp=5144223940&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=5144223940&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2004.833064
DO - 10.1109/TCOMM.2004.833064
M3 - Article
AN - SCOPUS:5144223940
SN - 1558-0857
VL - 52
SP - 1575
EP - 1584
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 9
ER -