检索结果-内蒙古大学图书馆

Capacity and random-coding exponents for channel coding with side information

IEEE TRANSACTIONS ON information THEORY 2007年第4期53卷 1326-1347页

作者： Moulin, Pierre Wang, Ying Univ Illinois Beckman Inst Coordinated Sci Lab Urbana IL 61801 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is to be reliably transmitted through a noisy channel with finite input and output alphabets and random state sequence, and the channel is selected by a hypothetical adversary. Partial information about the state sequence is available to the encoder, adversary, and decoder. The design of the transmitter is subject to a cost constraint. Two families of channels are considered: 1) compound discrete memoryless channels (CDMC), and 2) channels with arbitrary memory, subject to an additive cost constraint, or more generally, to a hard constraint on the conditional type of the channel output given the input. Both problems are closely connected. The random-coding exponent is achieved using a stacked binning scheme and a maximum penalized mutual information decoder, which may be thought of as an empirical generalized maximum a posteriori decoder. For channels with arbitrary memory, the random-coding exponents are larger than their CDMC counterparts. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers, and problems such as broadcast channels, all of which involve the fundamental idea of binning.

关键词： arbitrarily varying channels broadcast channels capacity channel coding with side information data hiding error exponents maximum a posteriori probability (MAP) decoding method of types random binning randomized codes reliability function universal coding and decoding watermarking

来源：评论

学校读者我要写书评

暂无评论

Duality between source coding and channel coding and its extension to the side information case

引用

IEEE TRANSACTIONS ON information THEORY 2003年第5期49卷 1181-1203页

作者： Pradhan, SS Chou, J Ramchandran, K Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We explore the information-theoretic duality between source coding with side information at the decoder and channel coding with side information at the encoder. We begin with a mathematical characterization of the functional duality between classical source and channel coding, formulating the precise conditions under which the optimal encoder for one problem is functionally identical to the optimal decoder for the other problem. We then extend this functional duality to the case of coding with side information. By invoking this duality, we are able to generalize the result of Wyner and Ziv [1] relating to no rate loss for source coding with side information from Gaussian to more arbitrary distributions. We consider several examples corresponding to both discrete- and continuous-valued cases to illustrate our formulation. For the Gaussian cases of coding with side information, we invoke geometric arguments to provide further insights into their duality. Our geometric treatment inspires the construction and dual use of practical coset codes for a large class of emerging applications for coding with side information, such as distributed sensor networks, watermarking, and information-hiding communication systems.

关键词： capacity-cost function channel coding with side information duality rate-distortion function source coding with side information

来源：评论

学校读者我要写书评

暂无评论

Achievable Error Exponents for channels With side information-Erasure and List Decoding

引用

IEEE TRANSACTIONS ON information THEORY 2010年第11期56卷 5424-5431页

作者： Sabbag, Erez Merhav, Neri Technion Israel Inst Technol Dept Elect Engn IL-32000 Technion Haifa Israel

We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, a universally achievable region of error exponents is offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszar and Korner's decoder. Then, the proposed decoding rule is generalized by extending the range of its parameters to allow variable size list decoding. This extension gives a unified treatment for erasure/list decoding. An achievable region of exponential bounds on the probability of list error and the average number of incorrect messages on the list are given. Relations to Forney's and Csiszar and Korner's decoders for discrete memoryless channel are discussed. These results are obtained by exploring a random binning code with conditionally constant composition codewords proposed by Moulin and Wang, but with a different decoding rule and a modified analysis.

关键词： channel coding with side information erasure error exponents list method of types random binning random coding

来源：评论

学校读者我要写书评

暂无评论

Colored Gaussian source-channel broadcast for heterogeneous (analog/digital) receivers

引用

IEEE TRANSACTIONS ON information THEORY 2008年第4期54卷 1807-1814页

作者： Prabhakaran, Vinod M. Puri, Rohit Ramchandran, Karman Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA NVIDIA Corp Santa Clara CA 95051 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

The problem of transmitting a Gaussian source with memory to a digital and a linear-analog receiver, over an arbitrarily colored, non-degraded Gaussian broadcast channel is studied. The main result of this work is a complete characterization of the set of achievable distortion pairs at the two receivers given a power constraint at the transmitter. Further, a constructive hybrid uncoded-coded scheme consisting of the cascade of source coding with side information and channel coding with side information systems is shown to achieve the entire power-mean squared error (MSE) distortion region associated with the problem. An interesting operating point in this region is one where the digital receiver obtains the classical point-to-point optimal quality and the analog receiver attains the best possible simultaneously achievable distortion. This problem is motivated by the practical application of the seamless "in-band" digital upgrade of legacy analog transmission systems.

关键词： channel coding with side information colored Gaussian source-channel broadcast digital simulcast in-band digital overlay non-degraded broadcast source coding with side information source-channel broadcast

来源：评论

学校读者我要写书评

暂无评论

Turbo coded trellis-based constructions for data hiding

Turbo coded trellis-based constructions for data hiding

引用

4th Conference on Security and Watermarking of Multimedia Contents

作者： Chou, J Ramchandran, K Pradhan, SS Univ Calif Berkeley Dept EECS Berkeley CA 94708 USA

ISBN: (纸本)0819444154

It has recently been discovered that many current applications such as data hiding and watermarking can be posed as the problem of channel coding with side information. As a result there has been considerable interest in designing codes (see Chou et. al,(4) Kesal et. al(5) and Eggers et. al(6)) to try and attain the theoretical capacity of the problem. It was shown by Pradhan et. al that in order to achieve capacity, a powerful channel codebook that partitions into a powerful source codebook should be chosen. The data to be embedded will index the source codebook partition. The constructions that exist in the literature, however, are typically based on powerful channel codebooks and weak source codebook partitions and hence remain at a considerable gap to capacity. In this paper, we present several methods of construction that are based on a powerful channel codebook (i.e. turbo codes) and powerful source codebook partitions (i.e., trellis coded quantization) to try and bridge the gap to capacity. For the Gaussian channel coding with side information (CCSI) problem at a transmission rate of I bit/channel use, our proposed approach comes within 2.72 dB of the information-theoretic capacity established by Costa.(1).

关键词： data hiding channel coding with side information turbo codes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：