By Topic

Coding for Channels With Rate-Limited Side Information at the Decoder, With Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yossef Steinberg ; Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa

In this work, coding for channel with partial state information at the decoder is studied. Specifically, the model under consideration assumes that the encoder is provided with full channel state information (CSI) in a noncausal manner, and the decoder is provided with partial state knowledge, quantified by a rate limit. Coding of side information intended for the channel decoder is a Wyner-Ziv like problem, since the channel output depends statistically on the state, thus serving as side information in retrieving the encoded state. Therefore, coding for such a channel involves the simultaneous solution of a Wyner-Ziv problem and a related Gel'fand-Pinsker problem. A single-letter characterization of the capacity of this channel is developed, that involves two rate constraints, in the form of Wyner-Ziv and Gel'fand-Pinsker formulas. Applications are suggested to watermarking problems, where a compressed version of the host signal is present at the decoder. Two main models are examined: the standard watermarking problem, where the decoder is interested only in the embedded information, and the reversible information embedding problem, where the decoder is interested also in exact reproduction of the host. For both problems, single-letter characterizations of the region of all achievable rate-distortion triples (R, Rd, D) are given, where R is the embedding rate, Rd is the rate limit of the compressed host at the decoder, and D is the average distortion between the host and the composite data set (stegotext). For reversible information embedding, two stages of attack are considered, modeled by a degraded broadcast channel, where the weaker (degraded) channel represents the second attack, and both decoders are required to fully reproduce the host.

Published in:

IEEE Transactions on Information Theory  (Volume:54 ,  Issue: 9 )