
Proceedings Paper
Joint source-channel decoding for MPEG-2 video transmissionFormat | Member Price | Non-Member Price |
---|---|---|
$14.40 | $18.00 |
![]() |
GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. | Check Access |
Paper Abstract
Joint source-channel coding schemes have been proven to be effective ways for reliable multimedia communications. In this paper, a joint source-channel decoding (JSCD) scheme that combines the hidden Markov source (HMS) estimation and low-density parity-check (LDPC) coding is proposed for the standard MPEG-2 video transmission. The LDPC code of the proposed scheme has a near-Shannon-limit error-correcting capability, while the HMS estimator may accurately extract the residual redundancy within the MPEG-2 video stream without any prior information. Furthermore, with a joint iterative decoding algorithm, the estimated source redundancy may be well exploited by the LDPC decoder, and the channel decoding feedback may refine the subsequence HMS estimation, thereby effectively improving the system performance. On the other hand, we also show that the proposed JSCD scheme has approximately the same computation complexity as that of the standard decoding scheme. Moreover, it is worth noting that the proposed scheme is based on separation encoding schemes, which is very convenient to be applied to existing multimedia transmission systems.
Paper Details
Date Published: 25 October 2004
PDF: 9 pages
Proc. SPIE 5600, Multimedia Systems and Applications VII, (25 October 2004); doi: 10.1117/12.580529
Published in SPIE Proceedings Vol. 5600:
Multimedia Systems and Applications VII
Chang Wen Chen; C.-C. Jay Kuo; Anthony Vetro, Editor(s)
PDF: 9 pages
Proc. SPIE 5600, Multimedia Systems and Applications VII, (25 October 2004); doi: 10.1117/12.580529
Show Author Affiliations
Published in SPIE Proceedings Vol. 5600:
Multimedia Systems and Applications VII
Chang Wen Chen; C.-C. Jay Kuo; Anthony Vetro, Editor(s)
© SPIE. Terms of Use
