|M.Sc Student||Cemal Yakup|
|Subject||Coding Problems for Single-User and Multiple-Access|
Channels with Coded Side Information at the
|Department||Department of Electrical Engineering||Supervisor||Professor Yossef Steinberg|
Coding for channels with rate-limited, coded, partial channel state information at the transmitter and full side information (SI) at the receiver is studied. This work is divided into three parts. In the first part, we consider joint state-source-channel coding. In particular, we deal with lossy transmission of a source, over a cost constrained state controlled channel where the receiver gets full SI and the transmitter receives coded, partial SI. We derive a single letter characterization of the achievable distortion-cost triples. From this characterization a separation principle follows for both, coding of the main source and coding of the transmitter side information. In the second part, we consider channel coding when the transmitter gets multiple descriptions (MD) of the SI. Inner and outer bounds are derived on the set of achievable partial description and forward channel rates. As a special case of MD SI coding, we consider also hierarchical coding of SI. Complete characterization of the set of all achievable rates is obtained, and Markov conditions for successive refinability of SI are derived. The last part deals with the multiple access channel controlled by random parameters, with full SI at the decoder, and partial, rate limited, SI at the encoders. A single letter characterization of the capacity region is derived, for the special case where the side information is degraded. Inner and outer bounds are derived on the capacity region of that channel, for the general case where there are no restrictions on the structure of the SI at the two encoders. The techniques employed for coding the rate-limited SI, and the achievable regions so obtained, are closely related to the problems of hierarchical source coding, and multiple descriptions.