We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users’ code books, i.e., they perform oblivious processing. The destination,or central processor, however, is informed about the users’ code books. We establish a single-letter characterization of the capacity region of this model for a class of discrete memory less channels in which the outputs at the relay nodes are independent given the users’ inputs. We show that both relaying à-la Cover–El Gamal, i.e., compress-and-forward with joint decompression and decoding, and noisy network codingare optimal. The proof of the converse part establishes, and utilizes,connections with the Chief Executive Officer source coding problem under logarithmic loss distortion measure. Extensions to general discrete memory less channels are also investigated.In this case, we establish the inner and outer bounds on the capacity region. For memory less Gaussian channels within the studied class of channels, we characterize the capacity region when the users are constrained to time-share among Gaussian code books. Furthermore, we also discuss the sub optimality of separate decompression and decoding and the role of time sharing.
To View the Base Paper Abstract Contents
Now it is Your Time to Shine.
Great careers Start Here.
We Guide you to Every Step
Success! You're Awesome
Thank you for filling out your information!
We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.
To know more details Call 900 31 31 555
The WISEN Team