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

cascade source coding With a Side Information Vending Machine

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第11期60卷 6888-6901页

作者： Ahmadi, Behzad Choudhuri, Chiranjib Simeone, Osvaldo Mitra, Urbashi New Jersey Inst Technol Dept Elect & Comp Engn Ctr Wireless Commun & Signal Proc Res Newark NJ 07102 USA Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

The model of a side information vending machine (VM) accounts for scenarios in which the measurement of side information sequences can be controlled via the selection of cost-constrained actions. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information VM is available at the intermediate and/or end node of the cascade. A single-letter characterization of the achievable tradeoff among the transmission rates, distortions in the reconstructions at the intermediate and end node, and cost for acquiring the side information is derived for a number of relevant special cases. It is shown that a joint design of the description, source, and control signals used to guide the selection of the actions at downstream nodes is generally necessary for an efficient use of the available communication links. In particular, for all the considered models, layered coding strategies prove to be optimal, whereby the base layer fulfills two network objectives: 1) determining the actions of downstream nodes and 2) simultaneously providing a coarse description of the source. Design of the optimal coding strategy is shown via examples to depend on both the network topology and action costs. Examples also illustrate the involved performance tradeoffs across the network.

关键词： Rate-distortion theory cascade source coding side information vending machine common reconstruction constraint

来源：评论

学校读者我要写书评

暂无评论

Heegard-Berger and cascade source coding Problems With Common Reconstruction Constraints

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第3期59卷 1458-1474页

作者： Ahmadi, Behzad Tandon, Ravi Simeone, Osvaldo Poor, H. Vincent New Jersey Inst Technol Ctr Wireless Commun & Signal Proc Res Newark NJ 07102 USA Princeton Univ Princeton NJ 08544 USA

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications, this may be undesirable, and a common reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on the decoder's estimate, may be instead in order. The rate-distortion function under the CR constraint has been derived recently for a point-to-point (Wyner-Ziv) problem. In this paper, this result is extended to three multiterminal settings with three nodes, namely the Heegard-Berger (HB) problem, its variant with cooperating decoders, and the cascade source coding problem. The HB problem consists of an encoder broadcasting to two decoders with respective side information. The cascade source coding problem is characterized by a two-hop system with side information available at the intermediate and final nodes. For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion metrics. The rate-distortion function is then characterized for the HB problem with cooperating decoders and (physically) degraded side information. For the cascade problem with the CR constraint, the rate-distortion region is obtained under the assumption that side information at the final node is physically degraded with respect to that at the intermediate node. For the latter two cases, it is worth emphasizing that the corresponding problem without the CR constraint is still open. Outer and inner bounds on the rate-distortion region are also obtained for the cascade probl

关键词： cascade source coding common reconstruction (CR) Heegard-Berger (HB) problem source coding with side information

来源：评论

学校读者我要写书评

暂无评论

On cascade source coding with A Side Information "Vending Machine"

On Cascade Source Coding with A Side Information "Vending Ma...

引用

IEEE Information Theory Workshop (ITW)

作者： Ahmadi, Behzad Simeone, Osvaldo Choudhuri, Chiranjib Mitra, Urbashi New Jersey Inst Technol ECE Dept CWCSPR Newark NJ 07102 USA Univ Southern Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781467302234;9781467302241

(1)The model of a side information "vending machine" accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions.

关键词： Rate-distortion theory cascade source coding side information vending machine common reconstruction constraint

来源：评论

学校读者我要写书评

暂无评论

Distributed and cascade Lossy source coding With a Side Information "Vending Machine"

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第10期59卷 6807-6819页

作者： Ahmadi, Behzad Simeone, Osvaldo New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA New Jersey Inst Technol CWCSPR Newark NJ 07102 USA

source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv problem, can be controlled by the decoder. This control action is selected by the decoder based on the message encoded by the source node. Unlike conventional settings, the message can thus carry not only information about the source to be reproduced at the decoder, but also control information aimed at improving the quality of the side information. In this paper, the analysis of the tradeoffs between rate, distortion, and cost associated with the control actions is extended from the previously studied point-to-point setup to two basic multiterminal models. First, a distributed source coding model is studied, in which two encoders communicate over rate-limited links to a decoder, whose side information can be controlled. The control actions are selected by the decoder based on the messages encoded by both source nodes. For this setup, inner bounds are derived on the rate-distortion-cost region for both cases in which the side information is available causally and noncausally at the decoder. These bounds are shown to be tight under specific assumptions, including the scenario in which the sequence observed by one of the nodes is a function of the source observed by the other and the side information is available causally at the decoder. Then, a cascade scenario in which three nodes are connected in a cascade and the last node has controllable side information is also investigated. For this model, the rate-distortion-cost region is derived for general distortion requirements and under the assumption of causal availability of side information at the last node.

关键词： cascade source coding distributed source coding observation costs rate-distortion theory side information side information vending machine

来源：评论

学校读者我要写书评

暂无评论

cascade and Triangular source coding With Side Information at the First Two Nodes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第6期58卷 3339-3349页

作者： Permuter, Haim H. Weissman, Tsachy Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel Stanford Univ Dept Elect Engn Stanford CA 94305 USA

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems, as well as some of their extensions. For the quadratic Gaussian case, we show that it is sufficient to consider jointly Gaussian distributions, which leads to an explicit solution.

关键词： cascade source coding empirical coordination multihop coding Pareto frontier quadratic Gaussian rate distortion side information source coding triangular source coding

来源：评论

学校读者我要写书评

暂无评论

cascade and Triangular source coding with causal side information

Cascade and Triangular source coding with causal side inform...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Chia, Yeow-Khiang Weissman, Tsachy Stanford Univ Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)9781457705953

We consider cascade and triangular source coding with side information and causal reconstruction at the end node. When the side information at the source and intermediate nodes are the same, we characterize the rate distortion regions for both the cascade and triangular source coding problems. For the general cascade setting with causal reconstruction at the end node, we characterize the rate region when the sources satisfy a positivity condition, or when a Markov chain holds.

关键词： Decoding Markov chain Markov processes Markov processes Random variables Rate-distortion source coding cascade source coding causal reconstruction causal side information intermediate node rate distortion region source coding triangular source coding

来源：评论

学校读者我要写书评

暂无评论

Distributed and cascade Lossy source coding with a Side Information "Vending Machine"

Distributed and Cascade Lossy Source Coding with a Side Info...

引用

IEEE International Symposium on Information Theory

作者： Ahmadi, Behzad Simeone, Osvaldo New Jersey Inst Technol ECE Dept CWCSPR Newark NJ 07102 USA

ISBN: (纸本)9781467325790

source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence can be controlled by the decoder based on the message received from the encoder. In this paper, the characterization of the optimal rate-distortion performance as a function of the cost associated with the control actions is extended from the previously studied point-to-point set-up to two multiterminal models. First, a distributed source coding model is studied, in which two encoders communicate over rate-limited links to a decoder, whose side information can be controlled based on the control actions selected by one of the encoders. The rate-distortion-cost region is characterized under the assumption of lossless reconstruction of the source encoded by the node that does not control the side information. Then, a three-node cascade scenario is investigated, in which the last node has controllable side information. The rate-distortion-cost region is derived for general distortion requirements and under the assumption of "causal" availability of side information at the last node.

关键词： Distributed source coding cascade source coding observation costs side information rate-distortion theory

来源：评论

学校读者我要写书评

暂无评论

cascade and Triangular source coding with Side Information at the First Two Nodes

Cascade and Triangular Source Coding with Side Information a...

引用

2010 IEEE International Symposium on Information Theory

作者： Permuter, Haim H. Weissman, Tsachy Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)9781424469604

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the quadratic Gaussian case, we show that it suffices to consider jointly Gaussian distributions, a fact that leads to an explicit solution.

关键词： cascade source coding empirical coordination quadratic Gaussian Pareto frontier source coding side information rate distortion triangular source coding

来源：评论

学校读者我要写书评

暂无评论

cascade, Triangular, and Two-Way source coding With Degraded Side Information at the Second User

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第1期58卷 189-206页

作者： Chia, Yeow-Khiang Permuter, Haim H. Weissman, Tsachy Stanford Univ Dept Elect Engn Stanford CA 94305 USA Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

In this paper, we consider the cascade and triangular rate-distortion problems where the same side information is available at the source node and user 1, and the side information available at user 2 is a degraded version of the side information at the source node and user 1. We characterize the rate-distortion region for these problems. For the cascade setup, we show that, at user 1, decoding and rebinning the codeword sent by the source node for user 2 is optimum. We then extend our results to the two-way cascade and triangular setting, where the source node is interested in lossy reconstruction of the side information at user 2 via a rate limited link from user 2 to the source node. We characterize the rate-distortion regions for these settings. Complete explicit characterizations for all settings are given in the quadratic Gaussian case. We conclude with two further extensions: a triangular source coding problem with a helper, and an extension of our two-way cascade setting in the quadratic Gaussian case.

关键词： cascade source coding triangular source coding two-way source coding quadratic Gaussian source coding with a helper

来源：评论

学校读者我要写书评

暂无评论

In-Network Compression for Multiterminal cascade MIMO Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第10期65卷 4176-4187页

作者： Aguerri, Inaki Estella Zaidi, Abdellatif France Res Ctr Math & Algorithm Sci Lab F-92100 Boulogne France Univ Paris Est F-77454 Marne La Vallee France Paris Res Ctr Math & Algorithm Sci Lab F-92100 Boulogne France

We study the problem of receive beamforming in uplink cascade multiple-input multiple-output (MIMO) systems as an instance of that of cascade multiterminal source coding for lossy function computation. Using this connection, we develop two coding schemes for the second and show that their application leads to beamforming schemes for the first. In the first coding scheme, each terminal in the cascade sends a description of the source that it observes;the decoder reconstructs all sources, lossily, and then computes an estimate of the desired function. This scheme improves upon standard routing in that every terminal only compresses the innovation of its source w. r. t. the descriptions that are sent by the previous terminals in the cascade. In the second scheme, the desired function is computed gradually in the cascade network, and each terminal sends a finer description of it. In the context of uplink cascade MIMO systems, the application of these two schemes leads to centralized receivebeamforming and distributed receive-beamforming, respectively. Numerical results illustrate the performance of the proposed methods and show that they outperform standard routing.

关键词： cascade source coding rate distortion lossy function computation chained MIMO systems distributed centralized beamforming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：