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

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第3期13卷 1424-1435页

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

In this paper, we consider the problem of transmitting two correlated binary sources over orthogonal multiple access relay channel (MARC), where two sources are communicating with a common destination with the assistance of a single relay. We assume decode-and-forward relaying strategy, and bit-wise exclusive or (XOR) network coding is performed at the relay node. First, a joint source-channel-network (JSCN) decoding technique is proposed to fully exploit the correlation between the sources, as well as the benefit of network coding. Then the achievable compression rate region of this system is derived based on the theorem for source coding with side information. It is found that the region is a 3-dimensional space surrounded by a polyhedron. Furthermore, the performance limit in Additive White Gaussian Noise (AWGN) channels and the outage probability in block Rayleigh fading channels are derived based on the achievable compression rate region. It is shown that the outage probability can be expressed by a set of triple integrals over the achievable compression rate region. The impact of source correlation on the performance of the system is investigated through asymptotic tendency analysis. The effectiveness of the proposed JSCN decoding technique and the accuracy of the theoretical analysis have been verified through a series of computer simulations, assuming practical channel codes. It is also shown that, as long as the source-relay links are perfect, the 2nd order diversity is always achieved with our proposed technique regardless of the strength of the source correlation.

关键词： Multiple access relay channel decode-and-forward correlated sources joint source-channel-network coding source coding with side information theorem outage probability

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2004年第6期22卷 988-998页

作者： Murugan, AD Gopala, PK El Gamal, H Ohio State Univ Dept Elect Engn Columbus OH 43210 USA

We consider wireless sensor networks deployed to observe arbitrary random, fields., The requirement is to reconstruct an estimate of the random field at a certain collector node. This creates a many-to-one data gathering, wireless channel. One of the main challenges in this scenario is that the source/channel separation theorem, proved by Shannon for point-to-point links, does not hold anymore. In this, paper, we construct novel cooperative source-channel coding schemes that exploit the wireless channel and the correlation between the sources. In particular, we differentiate between two distinct cases. The first case assumes that the sensor nodes are equipped with receivers and, hence, every node,can exploit the wireless link to distribute its information to its neighbors. We then devise an efficient, deterministic cooperation strategy where the neighboring nodes act as virtual antennas in a beamforming configuration. The second, and more challenging, scenario restricts the capability of sensor nodes to transmit only. In this case, we argue that statistical cooperative source-channel coding techniques still yield significant performance gains in certain relevant scenarios. Specifically, we propose a low complexity cooperative source-channel coding scheme based on the proper use of low-density generator matrix codes. This scheme is shown to outperform the recently proposed joint source-channel coding scheme (Garcia-Frias et al., 2002) in the case of highly correlated sources. In both the. deterministic and statistical cooperation scenarios, we develop analytical results that guide the optimization of the proposed schemes and validate the performance gains observed in simulations.

关键词： beamforming cooperative transmission schemes correlated sources dense sensor networks Gaussian multiple-access channel (GNUC) low-density generator matrix (LDGM) codes source-channel coding

来源：评论

学校读者我要写书评

暂无评论

引用

作者： Liu, Wei Syracuse University

学位级别：Ph.D.

Correlation is often present among observations in a distributed system. This thesis deals with various design issues when correlated data are observed at distributed terminals, including: communicating correlated sources over interference channels, characterizing the common information among dependent random variables, and testing the presence of dependence among observations. It is well known that separated source and channel coding is optimal for point-to-point communication. However, this is not the case for multi-terminal communications. In this thesis, we study the problem of communicating correlated sources over interference channels (IC), for both the lossless and the lossy case. For lossless case, a sufficient condition is found using the technique of random source partition and correlation preserving codeword generation. The sufficient condition reduces to the Han-Kobayashi achievable rate region for IC with independent observations. Moreover, the proposed coding scheme is optimal for transmitting a special correlated sources over a class of deterministic interference channels. We then study the general case of lossy transmission of two correlated sources over a two-user discrete memoryless interference channel (DMIC). An achievable distortion region is obtained and Gaussian examples are studied. The second topic is the generalization of Wyner's definition of common information of a pair of random variables to that of N random variables. Coding theorems are obtained to show that the same operational meanings for the common information of two random variables apply to that of N random variables. We establish a monotone property of Wyner's common information which is in contrast to other notions of the common information, specifically Shannon's mutual information and Gács and Körner's common randomness. Later, we extend Wyner's common information to that of continuous random variables and provide an operational meaning using the Gray-Wyner network with lossy

关键词： Common Information correlated sources Interference Channels Joint Source Channel Coding Test of Independence

来源：评论

学校读者我要写书评

暂无评论

Iterative joint channel decoding of correlated sources employing serially concatenated convolutional codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第7期51卷 2721-2731页

作者： Daneshgaran, F Laddomada, M Mondin, M Calif State Univ Los Angeles Dept Elect & Comp Engn Los Angeles CA 90032 USA Politecn Torino Dipartimento Elettron I-10129 Turin Italy

This correspondence looks at the problem of joint decoding of serially concatenated convolutional codes (SCCCs) used for channel coding of multiple correlated sources. We assume a simple model whereby two correlated sources transmit SCCC encoded data to a single destination receiver. We do not assume the existence of, nor do we use channel side information at the receiver. In particular, we present a novel iterative joint channel decoding algorithm for correlated sources by using the empirical cross-correlation measurements at successive decoding iterations to provide extrinsic information to the outer codes of the SCCC configuration. Two levels of soft metric iterative decoding are used at the receiver: 1) iterative maximum a posteriori probability (MAP) decoding is used for efficient decoding of individual SCCC codes (local iterations) and 2) iterative extrinsic information feedback generated from the estimates of the empirical cross correlation in partial decoding steps is used to pass soft information to the outer decoders of the global joint SCCC decoder (global iterations). We provide analytical results followed by simulation studies confirming the robustness of the cross-correlation estimates to channel-induced errors, justifying the use of such estimates in iterative decoding. Experimental results suggest that relatively few global iterations (two to five) during which multiple local iterations are conducted are sufficient to reap significant gains using this approach specially when the sources are highly correlated.

关键词： concatenated codes convolutional code correlated sources iterative decoding joint decoding serially concatenated codes Slepian-Wolf soft decoding turbo codes

来源：评论

学校读者我要写书评

暂无评论

Lattice-Based Robust Distributed Source Coding for Three correlated sources

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第7期68卷 4089-4103页

作者： Dumitrescu, Sorina Elzouki, Dania Chen, Jun McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

The problem of robust distributed source coding for three correlated sources is studied in this work. A lattice-based scheme is proposed and the analysis of its performance is provided in the high resolution regime. Special attention is paid to the degenerate case where the three sources are Gaussian and identical. In this case, our scheme is shown to achieve within an asymptotic gap of 0.069 bits in terms of rate per description from the information-theoretic limit of quadratic symmetric Gaussian multiple description coding with central and individual decoders, when the side distortion and the ratio between the central and side distortions both approach 0.

关键词： Lattices Decoding Robustness Source coding Distortion Indexes correlated sources distributed source coding lattice quantization asymptotic performance analysis high resolution multiple description coding

来源：评论

学校读者我要写书评

暂无评论

Secure transmission of correlated sources over broadcast channels with ultra-low latency

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2019年第1期2019卷 1-13页

作者： Chen, Hehe Zhu, Ping Wenzhou Vocat & Tech Coll Dept Elect & Elect Engn Wenzhou 325000 Peoples R China Wuhan Text Univ Coll Math & Comp Sci Wuhan 430200 Hubei Peoples R China

correlated sources passing through broadcast channels is considered in this paper. Each receiver has access to correlated source side information and each source at the sender is kept secret from the unintended receiver. This communication model can be seen as generalizations of Tuncel's source over broadcast channel and Villard et al.'s source over wiretap channel. An outer bound for secure transmission region of arbitrarily correlated sources with the equivocation-rate levels is derived with ultra-low latency and used to prove capacity results for several classes of sources and channels.

关键词： Broadcast channel Information-theoretic security correlated sources Ultra-low latency Side information

来源：评论

学校读者我要写书评

暂无评论

Network information flow with correlated sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第1期52卷 155-170页

作者： Barros, J Servetto, SD Tech Univ Munich Inst Commun Engn D-8000 Munich Germany Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

Consider the following network communication setup, originating in a sensor networking application we refer to as the "sensor reachback" problem. We have a directed graph G = (V, E), where V = {v(0)v(1)...v(n)} and E subset of V x V. If (v(i), v(j)) is an element of E, then node i can send messages to node j over a discrete memoryless channel (DMC) (X-ij, p(ij)(y vertical bar X), Y-ij), of capacity C-ij. The channels are independent. Each node v(i) gets to observe a source of information U-i(i = 0...M), with joint distribution p(U0U1...U-M). Our goal is to solve an incast problem in G: nodes exchange messages with their neighbors, and after a finite number of communication rounds, one of the M + 1 nodes (v(0) by convention) must have received enough information to reproduce the entire field of observations (U0U1...U-M), with arbitrarily small probability of error. In this paper, we prove that such perfect reconstruction is possible if and only if H(U-S vertical bar U-Sc) < Sigma(i is an element of S,j is an element of Sc) C-ij for all S subset of {0...M}, S not equal circle divide, 0 is an element of S-c. Our main finding is that in this setup;a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem surprising that separation holds in a fairly general network situation like the one we study. A. closer look, however, reveals that the reason for this is that our model allows only for independent point-to-point channels between pairs of nodes, and not multiple-access and/or broadcast channels, for which separation is well known not to hold. This "information as flow" view provides an algorithmic interpretation for our results, among which perhaps the most important one is the optimality of implementing codes using a layered protocol stack.

关键词： communication networks correlated sources directed graphs multiterminal source coding network algorithhms network analysis network architecture network capacity network coding network design network flow network protocols networks routing sensor networks

来源：评论

学校读者我要写书评

暂无评论

Interference Channels With Arbitrarily correlated sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第12期57卷 8027-8037页

作者： Liu, Wei Chen, Biao Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for lossless transmission of a pair of correlated sources over a discrete memoryless interference channel. With independent sources, the sufficient condition reduces to the Han-Kobayashi achievable rate region for interference channels. For sources with a special correlation structure, the proposed region reduces to the known achievable region for interference channels with common information. Moreover, the proposed coding scheme is optimal for transmitting such set of correlated sources over a class of deterministic interference channels as defined in El Gamal and Costa, 1982.

关键词： correlated sources interference channels lossless transmission separation approach source channel code

来源：评论

学校读者我要写书评

暂无评论

Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With correlated sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第9期59卷 5708-5722页

作者： Gohari, Amin Aminzadeh Yang, Shenghao Jaggi, Sidharth Sharif Univ Technol Dept Elect Engn Tehran Iran Tsinghua Univ Inst Theoret Comp Sci Inst Interdisciplinary Informat Sci Beijing 100084 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

Cut-set bounds are not, in general, tight for all classes of network communication problems. In this paper, we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, which results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of "uncertainty region" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand, we show that if the communication problem is solvable, the uncertainty of certain random variables in the network with respect to imaginary parties that have partial knowledge of the sources must satisfy some constraints that depend on the network architecture. On the other hand, the same uncertainties have to satisfy constraints that only depend on the joint distribution of the sources. Matching these two leads to restrictions on the statistical joint distribution of the sources in communication problems that are solvable over a given network architecture. Our technique also provides nontrivial outer bounds for communication problems with secrecy constraints.

关键词： correlated sources cut-set bound edge cut Gray-Wyner problem network coding uncertainty region

来源：评论

学校读者我要写书评

暂无评论

Universal coding for correlated sources with linked encoders

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第3期42卷 837-847页

作者： Oohama, Y Department of Computer Science and Communication Engineering Kyushu University Fukuoka Japan

On the coding for correlated sources we extend the Slepian-Wolf data compression system (called the SW system) to define a new system (called the SWL system), where two separate encoders of the SW system are mutually linked, Determining the optimal error exponent for all rates inside the admissible rate region remains an open problem for the SW system, In this paper we shall completely solve this problem for the SWL system, and show that the optimal exponents can be achieved by universal codes, Furthermore, it is shown that the linkage of two encoders does not extend the admissible rate region and does not even improve the exponent of correct decoding outside this region, The zero error data transmission problem for the SWL system is also considered, We shall determine the zero error rate region, the admissible rate region under the condition that the error probability of decoding is strictly zero, and show that this region can be attained hy universal codes, Furthermore, we make it clear that the linkage of encoders enlarges the zero error rate region, It is interesting to note that the above results for the SWL system correspond in some sense to the previous results for the discrete memoryless channel with feedback.

关键词： correlated sources linked encoders universal coding error exponents zero error rate region

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：