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

channels With Cost Constraints: Strong Converse and Dispersion

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第5期61卷 2415-2429页

作者： Kostina, Victoria Verdu, Sergio CALTECH Pasadena CA 91125 USA Princeton Univ Princeton NJ 08544 USA

This paper shows the strong converse and the dispersion of memoryless channels with cost constraints and performs a refined analysis of the third-order term in the asymptotic expansion of the maximum achievable channel coding rate, showing that it is equal to (1/2)((log n)/n) in most cases of interest. The analysis is based on a nonasymptotic converse bound expressed in terms of the distribution of a random variable termed the b-tilted information density, which plays a role similar to that of the d-tilted information in lossy source coding. We also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints.

关键词： Converse finite blocklength regime channels with cost constraints joint source-channel coding strong converse dispersion memoryless sources memoryless channels Shannon theory

来源：评论

学校读者我要写书评

暂无评论

Gaussian State Amplification with Noisy Observations

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第9期61卷 4587-4597页

作者： Tian, Chao Bandemer, Bernd Shamai (Shitz), Shlomo AT&T Labs Res Bedminster NJ 07921 USA Univ Calif San Diego Informat Theory & Applicat Ctr La Jolla CA 92093 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

We consider the problem of channel state amplification in a Gaussian channel with additive Gaussian channel states, where the encoder observes noncausally a noisy version of these states. A complete characterization is provided for the minimum reconstruction distortion under a transmitter power constraint, and it is shown that a simple analog scheme with power control is optimal. More precisely, if the power available to the encoder is below certain threshold, the analog scheme using full power is optimal, however, when the power available to the encoder is above that threshold, analog transmission using only a fixed amount of the available power is optimal. Furthermore, the problem of simultaneous message transmission and Gaussian state amplification with noisy observations is studied, for which an inner bound and two nontrivial outer bounds to the optimal tradeoff between the transmission rate and the state reconstruction distortion are provided. The coding scheme underlying the inner bound combines analog signaling and Gelfand-Pinsker coding, where the latter deviates from the operating point of Costa's dirty paper coding. The first outer bound is obtained by extending the channel decomposition technique, while the second outer bound requires a strategic analysis of the covariance matrix of the relevant random variables.

关键词： joint source-channel coding channel with state

来源：评论

学校读者我要写书评

暂无评论

SOFTCAST WITH PER-CARRIER POWER-CONSTRAINED channelS

SOFTCAST WITH PER-CARRIER POWER-CONSTRAINED CHANNELS

引用

IEEE International Conference on Image Processing

作者： S. Zheng M. Antonini M. Cagnazzo L. Guerrieri M. Kieffer I. Nemoianu R. Samy B. Zhang L2S CNRS-CentraleSupelec-Univ Paris-Sud I3S Univ. Nice-Sophia Antipolis CNRS LTCI CNRS Telecom ParisTech Universite Paris-Saclay STMicroelectronics S.r.l. SAGEMCOM R&T Direction

ISBN: (纸本)9781467399623

This paper considers the Softcast joint source-channel video coding scheme for data transmission over parallel channels with different power constraints and noise characteristics, typical in DSL or PLT channels. To minimize the mean square error at receiver, an optimal precoding matrix design problem has to be solved, which requires the solution of an inverse eigenvalue problem. Such solution is taken from the MIMO channel precoder design literature. Alternative suboptimal precoding matrices are also proposed and analyzed, showing the efficiency of the optimal precoding matrix within Softcast, which provides gains increasing with the encoded video quality.

关键词： joint source-channel coding Softcast Precoding matrices PLT channels Combined source-channel coding Mean square error prediction coding noise characteristics digital subscriber lines data transmission channels matrices Solutions parallel channel

来源：评论

学校读者我要写书评

暂无评论

On the Impact of Lossy channels in Wireless Edge Caching

On the Impact of Lossy Channels in Wireless Edge Caching

引用

Ad-Hoc and Sensor Networks Symposium

作者： Angela Sara Cacciapuoti Marcello Caleffi Mingyue Ji Jaime Llorca Antonia Maria Tulino DIETI Department University of Naples Federico II Broadcom Limited Bell Labs

ISBN: (纸本)9781479966653

One of the main challenges for continued wireless capacity growth is the difficulty in exploiting the multicast nature of the wireless medium: wireless end points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled access points that may be requesting different content and experiencing different channel conditions. To this end, we reformulate the caching-aided coded multicast problem as a joint source-channel coding problem and design an achievable scheme that preserves the cache-enabled multiplicative throughput gains of the error-free scenario, by guaranteeing per-receiver (access point) rates unaffected by the presence of receivers with worse channel conditions.

关键词： Video delivery Coded multicast Caching Wire-less channel joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Network Compression: Worst Case Analysis

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第7期61卷 3980-3995页

作者： Asnani, Himanshu Shomorony, Ilan Avestimehr, A. Salman Weissman, Tsachy Ericsson Res & Dev Sillicon Valley San Jose CA 95134 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA

We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results: 1) for an arbitrary memoryless network, among all distributed memoryless sources of a given correlation, Gaussian sources are least compressible, that is, they admit the smallest set of achievable distortion tuples and 2) for any memoryless source to be communicated over a memoryless additive-noise network, among all noise processes of a given correlation, Gaussian noise admits the smallest achievable set of distortion tuples. We establish these results constructively by showing how schemes for the corresponding Gaussian problems can be applied to achieve similar performance for (source or noise) distributions that are not necessarily Gaussian but have the same covariance.

关键词： Worst-case source worst-case noise network compression joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Outer Bounds on the Admissible source Region for Broadcast channels With Correlated sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第9期61卷 4616-4629页

作者： Khezeli, Kia Chen, Jun McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

Two outer bounds on the admissible source region for broadcast channels with correlated sources are presented: the first one is strictly tighter than the existing outer bound by Gohari and Anantharam, while the second one provides a complete characterization of the admissible source region in the case where the two sources are conditionally independent given the common part. These outer bounds are deduced from the general necessary conditions established for the lossy source broadcast problem via suitable comparisons between the virtual broadcast channel (induced by the source and the reconstructions) and the physical broadcast channel.

关键词： Bandwidth mismatch broadcast channel capacity region deterministic channel joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

A measure for the missed error detection probability for optimizing the forbidden symbol configuration in joint source-channel arithmetic codes

A measure for the missed error detection probability for opt...

引用

International Symposium on Circuits and Systems

作者： Hossein Kourkchi William E. Lynch M. Omair Ahmad Department of Electrical and Computer Engineering Concordia University 1455 de Maisonneuve Blvd. W. Montréal Québec Canada H3G 1M8

ISBN: (纸本)9781479953424

In joint source-channel arithmetic coding, a forbidden symbol (FS) is added to the symbol set to make it more robust against transmission errors. By splitting the interval occupied by the FS into subintervals, various configurations are possible. In this paper, the delay probability function (DPF), the probability of the number of bits required to detect an error, is calculated for various FS configurations. A figure of merit is also proposed for optimizing the FS configuration. It determines the probability of missed error detection (PMD). Simulations are carried out by employing a breadth-first suboptimal sequential MAP. The simulation results show the effectiveness of the proposed figure of merit, and support the FS configuration in which the FS interval lies entirely between the other information carrying symbols to be the best.

关键词： missed error detection Arithmetic coding maximum a posteriori (MAP) joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Broadcasting Correlated Vector Gaussians

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第5期61卷 2465-2477页

作者： Song, Lin Chen, Jun Tian, Chao McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4L8 Canada AT&T Labs Res Bedminster NJ 07921 USA

The problem of sending two correlated vector Gaussian sources over a bandwidth-matched two-user scalar Gaussian broadcast channel is studied in this paper, where each receiver wishes to reconstruct its target source under a covariance distortion constraint. We derive a lower bound on the optimal tradeoff between the transmit power and the achievable reconstruction distortion pair. Our derivation is based on a new bounding technique which involves the introduction of appropriate remote sources. Furthermore, it is shown that this lower bound is achievable by a class of hybrid schemes for the special case, where the weak receiver wishes to reconstruct a scalar source under the mean squared error distortion constraint.

关键词： Broadcast channel dirty paper coding Gaussian source joint source-channel coding Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第9期61卷 4765-4775页

作者： Wang, Chien-Yi Jeon, Sang-Woon Gastpar, Michael Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Andong Natl Univ Dept Informat & Commun Engn Andong 760749 South Korea

In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on the class of type-threshold functions, e.g., the maximum and the indicator functions. A simple network model capturing both the broadcast and superposition properties of wireless channels is considered: the collocated Gaussian network. A general multiround coding scheme exploiting superposition and interaction (through broadcast) is developed. Through careful scheduling of concurrent transmissions to reduce redundancy, it is shown that given any independent measurement distribution, all type-threshold functions can be computed reliably with a nonvanishing rate in the collocated Gaussian network, even if the number of sensors tends to infinity.

关键词： Gaussian networks interactive computation joint source-channel coding type-threshold functions

来源：评论

学校读者我要写书评

暂无评论

Binary Signaling of Correlated sources Over Orthogonal Multiple-Access channels

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2015年第5期4卷 501-504页

作者： Mitchell, Tyson P. Alajaji, Fady Linder, Tamas Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

The optimal energy allocations for minimizing the joint symbol error rate for binary signaling of two correlated sources over the orthogonal multiple-access Gaussian channel under joint maximum a priori (MAP) detection are determined. An exact expression for the system's probability of joint symbol error, as well as its union bound, is derived. Analytic minimization of the union bound reveals that the optimal energy allocation coincides with that of nonuniform binary signaling over the single-user additive white Gaussian noise channel. It is also shown numerically that the optimal energies that minimize the union bound also minimize the exact probability of error. Finally, it is shown via simulations for strongly biased sources that the use of joint MAP detection over two independent single-user systems leads to significant gains.

关键词： Error analysis joint source-channel coding MAP detection multiple-access channels nonuniform sources

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：