• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Coding for Channels With Rate-Limited Side Information at the Decoder, With Applications
【24h】

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

机译：在解码器上使用速率受限的边信息对通道进行编码，及其应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：在这项工作中，研究了在解码器中使用部分状态信息对信道进行编码。具体地，所考虑的模型假定以非因果的方式向编码器提供全信道状态信息（CSI），并且向解码器提供以速率限制量化的部分状态知识。打算用于信道解码器的辅助信息的编码是类似Wyner-Ziv的问题，因为信道输出在统计上取决于状态，因此在检索编码状态时用作辅助信息。因此，对这种信道进行编码涉及Wyner-Ziv问题和相关的Gel''fand-Pinsker问题的同时解决。开发了该信道容量的单字母表征，涉及两个速率约束，形式为Wyner-Ziv和Gel''fand-Pinsker公式。建议将其用于水印问题，其中在解码器处存在主机信号的压缩版本。研究了两个主要模型：标准水印问题，其中解码器仅对嵌入的信息感兴趣；以及可逆信息嵌入问题，其中解码器也对主机的精确再现感兴趣。对于这两个问题，都给出了所有可实现的速率失真三元组（R，Rd，D）的区域的单字母特征，其中R是嵌入速率，Rd是解码器处压缩主机的速率限制，D是主机和复合数据集（隐文本）之间的平均失真。对于可逆信息嵌入，考虑了两个阶段的攻击，以降级的广播信道为模型，其中较弱（降级）的信道代表第二次攻击，并且需要两个解码器才能完全重现主机。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号