Abstract
This chapter introduces theoretical justifications for joint source-channel coding (JSCC) and identifies certain expectations that one may have regarding JSCC and joint source-channel decoding (JSCD). It provides the basic information theoretic tools that are needed to understand the Shannon bounds in their various incarnations. One can evaluate, for simple sources, the minimum rate that is required to communicate the given source over a particular channel with a specified maximum end-to-end distortion. It demonstrates the separation theorem to be strongly dependent on the assumption of point-to-point communication of stationary sources without constraints on encoder/decoder complexity. Furthermore, it argues that practical applications (with complexity constraints, one-to-many architectures, and nonstationary sources and channels) can be better served by joint source/channel decoders. It then explains that JSCD, compared to separate channel decoding and source decoding, is better able to exploit imperfections (i.e., redundancy) in the received bitstream, especially when side information introduced by network protocols are considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.