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

multiterminal source coding with high resolution

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第1期45卷 106-117页

作者： Zamir, R Berger, T Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel Cornell Univ Sch Elect Engn Ithaca NY 14853 USA

We consider separate encoding and joint decoding of correlated continuous information sources, subject to a difference distortion measure. We first derive a multiterminal extension of the Shannon lower bound for the rate region. Then we show that this Shannon outer bound is asymptotically tight for small distortions. These results imply that the loss in the sum of the coding rates due to the separation of the encoders vanishes in the limit of high resolution, Furthermore, lattice quantizers followed by Slepian-Wolf lossless encoding are asymptotically optimal, We also investigate the high-resolution rate region in the remote coding case, where the encoders observe only noisy versions of the sources. For the quadratic Gaussian case, we establish a separation result to the effect that multiterminal coding aimed at reconstructing the noisy sources subject to the rate constraints, followed by estimation of the remote sources from these reconstructions, is optimal under certain regularity conditions on the structure of the coding scheme.

关键词： direct and remote rate-distortion high-resolution quantization multiterminal source coding Shannon lower bound

来源：评论

学校读者我要写书评

暂无评论

multiterminal source coding With Action-Dependent Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第6期59卷 3653-3667页

作者： Chia, Yeow-Khiang Asnani, Himanshu Weissman, Tsachy Stanford Univ Stanford CA 94305 USA

We consider multiterminal source coding with a single encoder and multiple decoders where either the encoder or the decoders can take cost-constrained actions which affect the quality of the side information present at the decoders. For the scenario where decoders take actions, we characterize the rate-cost tradeoff region for lossless source coding, and give an achievability scheme for lossy source coding for two decoders which is optimum for a variety of special cases of interest. For the case where the encoder takes actions, we characterize the rate-cost tradeoff for a class of lossless source coding scenarios with multiple decoders. Finally, we also consider extensions to other multiterminal source coding settings with actions, and characterize the rate-distortion-cost tradeoff for a case of successive refinement with actions.

关键词： Action-dependent side information actions costs decisions multiterminal source coding rate-distortion successive refinement

来源：评论

学校读者我要写书评

暂无评论

multiterminal source coding Under Logarithmic Loss

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第1期60卷 740-761页

作者： Courtade, Thomas A. Weissman, Tsachy Stanford Univ Dept Elect Engn Stanford CA 94305 USA

We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single-letter description of the achievable rate distortion region for all discrete memoryless sources with finite alphabets. By doing so, we also give the rate distortion region for the m-encoder CEO problem (also under logarithmic loss). Several applications and examples are given.

关键词： Logarithmic loss lossy compression multiterminal source coding rate-distortion rate region

来源：评论

学校读者我要写书评

暂无评论

multiterminal source coding: sum-rate loss, code designs, and applications to video sensor networks

Multiterminal source coding: sum-rate loss, code designs, an...

引用

作者： Yang, Yang Texas A&M University

学位级别：master

Driven by a host of emerging applications (e.g., sensor networks and wireless video),distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and various otherforms of multiterminal source coding), has recently become a very active research *** dissertation focuses on multiterminal (MT) source coding problem, and consistsof three parts. The first part studies the sum-rate loss of an important special caseof quadratic Gaussian multi-terminal source coding, where all sources are positively symmetricand all target distortions are equal. We first give the minimum sum-rate for jointencoding of Gaussian sources in the symmetric case, and then show that the supremum ofthe sum-rate loss due to distributed encoding in this case is 12 log254 = 0:161 b/s when L = 2and increases in the order of?L2 log2 e b/s as the number of terminals L goes to *** supremum sum-rate loss of 0:161 b/s in the symmetric case equals to that in generalquadratic Gaussian two-terminal source coding without the symmetric assumption. It isconjectured that this equality holds for any number of *** the second part, we present two practical MT coding schemes under the frameworkof Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT *** first, asymmetric SWCQ scheme relies on quantization and Wyner-Ziv coding, and itis implemented via source splitting to achieve any point on the sum-rate bound. In the second,conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressedusing symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practicaldesigns employ trellis-coded quantization and turbo/LDPC codes for both asymmetric andsymmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit persample away from the sum-rate bound for both direct and indirect MT coding *** third part applies the above two

关键词： multiterminal source coding

来源：评论

学校读者我要写书评

暂无评论

Generalized Gaussian multiterminal source coding in the High-Resolution Regime

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第6期68卷 3782-3791页

作者： Xie, Li Tu, Xiaolan Zhou, Siyao Chen, Jun Shanghai Acad Spaceflight Technol Inst Aerosp Syst Engn Shanghai Shanghai 201109 Peoples R China McMaster Univ Dept Math & Stat Hamilton ON L8S 4K1 Canada Canadian Imperial Bank Commerce Toronto ON M5H 3S5 Canada McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

A conjectural expression of the asymptotic gap between the rate-distortion function of an arbitrary generalized Gaussian multiterminal source coding system and that of its centralized counterpart in the high-resolutio... 详细信息

关键词： source coding Rate-distortion 3G mobile communication Distortion Sensor fusion Gaussian source information matrix mean squared error multiterminal source coding rate-distortion

来源：评论

学校读者我要写书评

暂无评论

An improved outer bound for multiterminal source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第5期54卷 1919-1937页

作者： Wagner, Aaron B. Anantharam, Venkat Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian two-encoder problem.

关键词： CEO problem erasure distortion multiterminal source coding outer bound rate region rate-distortion

来源：评论

学校读者我要写书评

暂无评论

Generalized Gaussian multiterminal source coding: The Symmetric Case

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第4期66卷 2115-2128页

作者： Chen, Jun Xie, Li Chang, Yameng Wang, Jia Wang, Yizhong McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada Shanghai Acad Spaceflight Technol Inst Aerosp Syst Engn Shanghai Dept Elect Syst Launch Vehicles Shanghai 201109 Peoples R China Shanghai Jiao Tong Univ Inst Image Commun & Network Engn Dept Elect Engn Shanghai 200240 Peoples R China Tianjin Univ Sci & Technol Coll Elect Informat & Automat Tianjin 300222 Peoples R China

Consider a generalized multiterminal source coding system, where ((l)(m)) encoders, each observing a distinct sizem subset of l (l >= 2) zero-mean unit-variance exchangeable Gaussian sources with correlation coefficient rho, compress their observations in such a way that a joint decoder can reconstruct the sources within a prescribed mean squared error distortion based on the compressed data. The optimal rate-distortion performance of this system was previously known only for the two extreme cases m = l (the centralized case) and m = 1 (the distributed case), and except when rho = 0, the centralized system can achieve strictly lower compression rates than the distributed system under all non-trivial distortion constraints. Somewhat surprisingly, it is established in the present paper that the optimal rate-distortion performance of the afore-described generalized multiterminal source coding system with m = 2 coincides with that of the centralized system for all distortions when rho <= 0 and for distortions below an explicit positive threshold (depending on m) when rho > 0. Moreover, when rho > 0, the minimum achievable rate of generalized multiterminal source coding subject to an arbitrary positive distortion constraint d is shown to be within a finite gap (depending on m and d) from its centralized counterpart in the large l limit except for possibly the critical distortion d = 1-rho.

关键词： Gaussian source mean squared error multiterminal source coding rate-distortion reverse water-filling

来源：评论

学校读者我要写书评

暂无评论

Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第7期51卷 2577-2593页

作者： Oohama, Y Kyushu Univ Grad Sch Fac Informat Sci & Elect Engn Dept Comp Sci & Commun EngnHigashi Ku Fukuoka 8128581 Japan

In this paper, we consider the separate coding problem for L + 1 correlated Gaussian memoryless sources. We deal with the case where L sources work as partial side information at the decoder for the reconstruction of the remaining source. The determination problem of the rate-distortion region for this system is the so-called many-help-one problem and it has been known as a highly challenging problem for almost 20 years. In this paper, we give a partial solution to this problem. We determine the rate-distortion region in the case where the L sources working as partial side information are conditionally independent if the remaining source we wish to reconstruct is given. The additive white Gaussian noise CEO problem is a special case of this. We also discuss the relation of the result previous results of ours.

关键词： CEO problem Gaussian many-help-one problem multiterminal source coding rate-distortion region

来源：评论

学校读者我要写书评

暂无评论

Vector Gaussian multiterminal source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第9期60卷 5533-5552页

作者： Wang, Jia Chen, Jun Shanghai Jiao Tong Univ Inst Image Commun & Network Engn Dept Elect Engn Shanghai 200240 Peoples R China McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

We derive an outer bound of the rate region of the vector Gaussian L-terminal CEO problem by establishing a lower bound on each supporting hyperplane of the rate region. To this end, we prove a new extremal inequality by exploiting the connection between differential entropy and Fisher information as well as some fundamental estimation-theoretic inequalities. It is shown that the outer bound matches the Berger-Tung inner bound in the high-resolution regime. We then derive a lower bound on each supporting hyperplane of the rate region of the direct vector Gaussian L-terminal source coding problem by coupling it with the CEO problem through a limiting argument. The tightness of this lower bound in the high-resolution regime and the weak-dependence regime is also proved.

关键词： Borsuk's theorem CEO problem extremal inequality Fisher information MMSE multiterminal source coding

来源：评论

学校读者我要写书评

暂无评论

On the Sum Rate of Gaussian multiterminal source coding: New Proofs and Results

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第8期57卷 3946-3960页

作者： Wang, Jia Chen, Jun Wu, Xiaolin Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

We show that the lower bound on the sum rate of the direct and indirect Gaussian multiterminal source coding problems can be derived in a unified manner by exploiting the semidefinite partial order of the distortion covariance matrices associated with the minimum mean squared error (MMSE) estimation and the so-called reduced optimal linear estimation, through which an intimate connection between the lower bound and the Berger-Tung upper bound is revealed. We give a new proof of the minimum sum rate of the indirect Gaussian multiterminal source coding problem (i.e., the Gaussian CEO problem). For the direct Gaussian multiterminal source coding problem, we derive a general lower bound on the sum rate and establish a set of sufficient conditions under which the lower bound coincides with the Berger-Tung upper bound. We show that the sufficient conditions are satisfied for a class of sources and distortion constraints;in particular, they hold for arbitrary positive definite source covariance matrices in the high-resolution regime. In contrast with the existing proofs, the new method does not rely on Shannon's entropy power inequality.

关键词： CEO problem entropy power inequality minimum mean squared error (MMSE) multiterminal source coding semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：