Abstract
Broadcasting Gaussian sources over a Gaussian broadcast channel is a major problem in information theory. Consider the problem of sending a correlated Gaussian source S= (S1, S2 … …. S <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</inf> ) over a power limited Gaussian broadcast channel. User i (1,2,… m) observes the transmitted signal which is affected by Gaussian noise with power σ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf> and desires to estimate S <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf> . This paper aims to analyze the distortion (squared error) regions that are simultaneously achievable at the receivers by using hybrid digital analog (HDA) joint source channel coding (JSCC) coding scheme. First, consider the problem of broadcasting a bivariate Gaussian source over a two-user power limited Gaussian broadcast channel to two users. Two bandwidth mismatch cases are considered: i) broadcasting with bandwidth compression, and ii) broadcasting with bandwidth expansion. This paper also considers the problem of broadcasting three Gaussian sources over a three user power limited Gaussian broadcast channel. First two sources are correlated and the third one is independent to other two sources. Finally, compare the achievable inner bound distortion region to outer bound distortion region.
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.