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

Optimistic Shannon coding theorems for arbitrary single-user systems

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第7期45卷 2623-2629页

作者： Chen, PN Alajaji, F Natl Chiao Tung Univ Dept Commun Engn Hsinchu Taiwan Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

The conventional definitions of the source coding rate and or channel capacity require the existence of reliable codes for all sufficiently large block lengths. Alternatively, if it is required that good codes exist for infinitely many block lengths, then optimistic definitions of source coding rate and channel capacity are obtained. In this work, formulas for the optimistic minimum achievable fixed-length source coding rate and the minimum epsilon-achievable source coding rate for arbitrary finite-alphabet sources are established, The expressions for the optimistic capacity and the optimistic epsilon-capacity of arbitrary single-user channels are also provided. The expressions of the optimistic source coding rate and capacity are examined for the class of information stable sources and channels, respectively, Finally, examples for the computation of optimistic capacity are presented.

关键词： error probability optimistic channel capacity optimistic source coding rate Shannon theory source-channel separation theorem

来源：评论

学校读者我要写书评

暂无评论

Outage Probabilities of Orthogonal Multiple-Access Relaying Techniques With Imperfect source-Relay Links

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第4期14卷 2269-2280页

作者： Lu, Pen-Shun Zhou, Xiaobo Matsumoto, Tad Univ Oulu Ctr Wireless Commun Oulu 90014 Finland Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa 9231292 Japan

An outage probability that is independent of signaling schemes is theoretically derived in this paper for an orthogonal multiple-access relay channel (MARC) system, where the estimates of the information sequences sent from source nodes, regardless of whether or not they are correctly decoded at the relay, are exclusive-OR (XOR)-network-coded and forwarded by the relay to the destination. The MARC system described above is referred to as estimates-exploiting MARC (e-MARC) in this paper for convenience. Following the probability derivation of e-MARC, comparisons are then made with the outage probability of the orthogonal MARC with the Select Decode-and-Forward relaying strategy (MARC-SDF). It is found through simulations that when one of the source nodes is far away from both the relay and the destination, the e-MARC system is superior to MARC-SDF in terms of outage performance. We further numerically calculate the outage probabilities for two special cases, and compare them with the probability of e-MARC. Furthermore, the impact of the source correlation on the outage probability of the e-MARC system is also investigated.

关键词： Multiple access relay channel outage probability decode-and-forward Slepian-Wolf theorem source-channel separation theorem

来源：评论

学校读者我要写书评

暂无评论

Distributed Sensing With Orthogonal Multiple Access: To Code or not to Code?

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2020年第0期68卷 1315-1330页

作者： Dong, Yunquan Nanjing Univ Informat Sci & Technol Sch Elect & Informat Engn Nanjing 210044 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China

We consider the estimation distortion of a distributed sensing system with finite number of sensor nodes, in which the nodes observe a common phenomenon and transmit their observations to a fusion center over orthogonal channels. In particular, we investigate whether the coded scheme (separate source-channel coding) outperforms the uncoded scheme (joint source-channel coding) or not. To this end, we explicitly derive the estimation distortion of a coded heterogeneous sensing system with diverse node and channel configurations. Based on this result, we show that in a homogeneous sensing system with identical node and channel configurations, the coded scheme outperforms the uncoded scheme if the number of nodes is $K=1$ or $K=2$. For homogenous sensing systems with $K\geq 3$ nodes and general heterogeneous sensing systems, we also present explicit conditions for the coded scheme to perform better than the uncoded scheme. Furthermore, we propose to minimize the estimation distortion of heterogeneous sensing systems with hybrid coding, i.e., some nodes use the coded scheme and other nodes use the uncoded scheme. To determine the optimal hybrid coding policy, we develop three greedy algorithms, in which the pure greedy algorithm minimizes distortion greedily, the group greedy algorithm improves performance by using a group of potential sub-polices, and the sorted greedy algorithm reduces computational complexity by using a pre-solved iteration order. Our numerical and Monte Carlo results show that the proposed algorithms closely approach the optimal policy in terms average estimation distortion.

关键词： Distributed sensing source-channel separation theorem estimation distortion greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Interference channels With Correlated Receiver Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第12期56卷 5984-5998页

作者： Liu, Nan Guenduez, Deniz Goldsmith, Andrea J. Poor, H. Vincent Stanford Univ Dept Elect Engn Stanford CA 94305 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source, it is shown that source-channel separation is optimal. When each receiver has side information correlated with the interfering source, sufficient conditions for reliable transmission are provided based on a joint source-channel coding scheme using the superposition encoding and partial decoding idea of Han and Kobayashi. When the receiver side information is a deterministic function of the interfering source, source-channel separation is again shown to be optimal. In addition to these source-channel coding problems, a new channel model that generalizes the classical interference channel is introduced: the interference channel with message side information. Achievable rate regions are given and a single letter characterization of the capacity region for a special class of Z-interference channels is provided. Using this capacity result and the optimality of source-channel separation, we demonstrate that our sufficient conditions for reliable transmission when each receiver has side information correlated with the interfering source are also necessary for some special cases. As a by-product, the capacity region of a class of Z-channels with degraded message sets is also provided.

关键词： Interference channel joint source-channel coding receiver side information source-channel separation theorem

来源：评论

学校读者我要写书评

暂无评论

Fading Correlations for Wireless Cooperative Communications: Diversity and Coding Gains

引用

IEEE ACCESS 2017年 5卷 8001-8016页

作者： Qian, Shen He, Jiguang Juntti, Markku Matsumoto, Tad Japan Adv Inst Sci & Technol Sch Informat Sci Nomi 9231292 Japan Univ Oulu Ctr Wireless Commun FI-90014 Oulu Finland

We theoretically analyze outage probabilities of the lossy-forward (LF), decode-and-forward (DF), and adaptive decode-and-forward (ADF) relaying techniques, with the aim of characterizing the impact of the spatial and temporal correlations of the fading variations. First, the exact outage probability expressions are analytically obtained for LF, DF, and ADF relaying assuming each link suffers from statistically independent Rayleigh fading. Then, approximated, yet accurate closed-form expressions of the outage probabilities for the relaying schemes are derived. Based on the expressions, diversity and coding gains are found. The mathematical methodology for the derivation of the explicit outage probability is further extended to the case, where the account is taken of the spatial and temporal correlations of the fading variations. The diversity gains with LF, DF, and ADF are then derived in the presence of the correlations. It is found out that the three techniques can achieve full diversity, as long as the fading variations are not fully correlated. We then investigate the optimal relay location and the optimal power allocation for the three relaying techniques. It is shown that the optimal solutions can be obtained under the framework of convex optimization. It is revealed that in correlated fading, the relay should move close to the destination or allocate more transmit power to the relay for achieving lower outage probabilities, compared with the case in independent fading.

关键词： Cooperation techniques relay channels fading variation outage probability diversity and coding gains spatial and temporal correlations source-channel separation theorem

来源：评论

学校读者我要写书评

暂无评论

Multiterminal source-channel communication over an orthogonal multiple-access channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第9期53卷 3255-3264页

作者： Xiao, Jin-Jun Luo, Zhi-Quan Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

We consider the problem of multiterminal source-channel communication where a number of distributed and possibly correlated sources are transmitted through an orthogonal multiple access channel to a common destination. We provide a characterization of the optimal tradeoff between the transmission cost F and the distortion vector D as measured against individual sources. Our approach consists of two steps: 1) a multiple-letter characterization of the rate-distortion region of the multiterminal source coding and 2) a source-channel separation theorem ensuring that all achievable pairs of (Gamma, D) can be obtained by combining the rate-distortion region and the orthogonal multiple access channel capacity region. As a corollary, we determine the optimal power and distortion tradeoff in a quadratic Gaussian sensor network under orthogonal multiple access, and show that separate source and channel coding strictly outperforms the uncoded (amplify-forward) transmission, and is in fact optimal in this case. This result is in sharp contrast to the case of nonorthogonal multiple access for which separate source and channel coding is not only suboptimal but also strictly inferior to uncoded transmission

关键词： Gaussian sensor networks multiterminal source coding rate-distortion region source-channel separation theorem uncoded transmission

来源：评论

学校读者我要写书评

暂无评论

Uncoded Transmission Is Exactly Optimal for a Simple Gaussian "Sensor" Network

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第11期54卷 5247-5251页

作者： Gastpar, Michael Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

A single memoryless Gaussian source is observed by many terminals, subject to independent Gaussian observation noises. The terminals are linked to a fusion center via a standard Gaussian multiple-access channel. The fusion center needs to recover the underlying Gaussian source with respect to mean-squared error. In this correspondence, a theorem of Witsenhausen is shown to imply that an optimal communication strategy is uncoded transmission, i.e., each terminal's channel input is merely a scaled version of its noisy observation.

关键词： Cut-set bound joint source-channel coding maximum correlation coefficient source-channel separation theorem

来源：评论

学校读者我要写书评

暂无评论

Remote source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第7期65卷 4486-4498页

作者： Eswaran, Krishnan Gastpar, Michael Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Google Inc Hlth Res Team Mountain View CA 94043 USA Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

The distributed remote source coding (the so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower bound for the sum-rate-distortion function under arbitrary distortion measures. When specialized to the case of mean-squared error, it is shown that the bound exactly mirrors a corresponding upper bound, except that the upper bound has the source power (variance), whereas the lower bound has the source entropy power. Bounds exhibiting this pleasing duality of power and entropy power have been well known for direct and centralized source coding since Shannon's work. While the bounds hold generally, their value is most pronounced when interpreted as a function of the number of agents in the CEO problem.

关键词： source coding CEO problem entropy power entropy power inequality source-channel separation theorem joint source-channel coding rate loss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：