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

Capacity Region of Cooperative Multiple-Access Channel With States

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第10期59卷 6153-6174页

作者： Zaidi, Abdellatif Piantanida, Pablo Shamai (Shitz), Shlomo Univ Paris Est Marne La Vallee F-77454 Marne La Vallee 2 France SUPELEC Dept Telecommun F-91190 Gif Sur Yvette France Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known noncausally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states noncausally transmits an individual message. We find explicit characterizations of the capacity region of this communication model in both discrete memoryless and memoryless Gaussian cases. In particular, the capacity region analysis demonstrates the utility of the knowledge of the states only strictly causally at the encoder that sends only the common message in general. More specifically, in the discrete memoryless setting, we show that such a knowledge is beneficial and increases the capacity region in general. In the Gaussian setting, we show that such a knowledge does not help, and the capacity is same as if the states were completely unknown at the encoder that sends only the common message. Furthermore, we also study the special case in which the two encoders transmit only the common message and show that the knowledge of the states only strictly causally at the encoder that sends only the common message is not beneficial in this case, in both discrete memoryless and memoryless Gaussian settings. The analysis also reveals optimal ways of exploiting the knowledge of the state only strictly causally at the encoder that sends only the common message when such a knowledge is beneficial. The encoders collaborate to convey to the decoder a lossy version of the state, in addition to transmitting the information messages through a generalized Gel'fand-Pinsker binning. Particularly important in this problem are the questions of 1) optimal ways of performing the state compression and 2) whether or not the compression indices should be decoded uniquely. By developing two optimal coding schemes that perform this state compression differently, we show that when used as parts of appropriately tuned

关键词： Capacity channel state information multiaccess channels noisy network coding Wyner-Ziv binning

来源：评论

学校读者我要写书评

暂无评论

Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay network

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第12期62卷 7078-7085页

作者： Li, Jing Kim, Young-Han Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

The multicast capacity of the Gaussian two-hop relay network with one source, N relays, and L destinations is studied. It is shown that a careful modification of the partial decode-forward coding scheme, whereby the relays recover and coherently transmit degraded sets of message parts, achieves the cutset upper bound within (1/2) log N bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode-forward yet has an unbounded gap from the cutset bound for L >= 2 destinations. When restricted to noncoherent transmission among the relays, the proposed partial decode-forward scheme achieves a slightly larger gap of log N bits from the cutset bound. The computation of this relaxed achievable rate involves evaluating mutual information across L(N + 1) cuts out of the total L2(N) possible cuts, providing a very simple linear-complexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.

关键词： Capacity approximation cutset bound distributed decode-forward noisy network coding partial decode-forward relay network

来源：评论

学校读者我要写书评

暂无评论

Achieving the Capacity of the N-Relay Gaussian Diamond network Within log N Bits

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第12期60卷 7708-7718页

作者： Chern, Bobbie Ozgur, Ayfer Stanford Univ Dept Elect Engn Stanford CA 94305 USA

We consider the N-relay Gaussian diamond network where a source node communicates to a destination node via N parallel relays through a cascade of a Gaussian broadcast (BC) and a multiple access (MAC) channel. Introduced in 2000 by Schein and Gallager, the capacity of this relay network is unknown in general. The best currently available capacity approximation, independent of the coefficients and the SNRs of the constituent channels, is within an additive gap of 1.3N bits, which follows from the recent capacity approximations for general Gaussian relay networks with arbitrary topology. In this paper, we approximate the capacity of this network within 2 log N bits. We show that two strategies can be used to achieve the information-theoretic cut-set upper bound on the capacity of the network up to an additive gap of O(log N) bits, independent of the channel configurations and the SNRs. The first of these strategies is simple partial decode-and-forward. Here, the source node uses a superposition codebook to broadcast independent messages to the relays at appropriately chosen rates;each relay decodes its intended message and then forwards it to the destination over the MAC channel. A similar performance can be also achieved with compress-and-forward type strategies (such as quantize-map-and-forward and noisy network coding) that provide the 1.3N-bit approximation for general Gaussian networks, but only if the relays quantize their observed signals at a resolution inversely proportional to the number of relay nodes N. This suggests that the rule-of-thumb to quantize the received signals at the noise level in the current literature can be highly suboptimal.

关键词： Gaussian relay networks capacity approximation diamond network noisy network coding partial decode-and-forward

来源：评论

学校读者我要写书评

暂无评论

Layered coding for the Interference Channel With a Relay

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 6154-6180页

作者： Do, Hieu T. Oechtering, Tobias J. Skoglund, Mikael KTH Royal Inst Technol ACCESS Linnaeus Ctr Sch Elect Engn S-10044 Stockholm Sweden

This paper studies and derives new results for the interference channel with a relay (ICR). Three inner bounds for the discrete memoryless ICR are proposed, based on three coding strategies that employ layered code at the relay. The first scheme is inspired by layered noisy network coding, proposed by Lim et al. for the two-way relay channel, the second and the third schemes rely on simpler encoding and decoding processes, dubbed layered quantize-forward. Performance of the proposed schemes is investigated for two classes of channels with Gaussian noise: the interference channel with in-band relay reception/out-of-band relay transmission and the interference with in-band relay reception/in-band relay transmission. For the former class of channels, it is shown that the first proposed scheme achieves the same inner bound as the generalized hash-forward scheme with incremental binning. In addition, the inner bound is within 0.5 bit of the capacity region under certain conditions on the channel parameters. For the latter class of channels, new upper bounds on sum-rate are established by extending known upper bounds for symmetric channels. The first inner bound is shown to be within 0.5 bit of the capacity region if the relay's power exceeds a certain threshold, which depends on channel parameters. Numerical examples show that the proposed schemes can achieve significantly higher sum-rates when compared with other compress-forward schemes. Analysis also reveals a tradeoff between achievable rates, coding delay, and complexity of the proposed schemes. Results in this paper provide a better understanding of coding for the ICR, in particular, they show that layered coding is a beneficial element in multiuser networks with relays.

关键词： Interference relay channel interference channel quantize-forward noisy network coding

来源：评论

学校读者我要写书评

暂无评论

On the Achievable Rates of Virtual Full-Duplex Relay Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第1期65卷 354-367页

作者： Hong, Song-Nam Hui, Dennis Maric, Ivana Caire, Giuseppe Ajou Univ Dept Elect & Comp Engn Suwon 16499 South Korea Ericsson Res San Jose CA 95134 USA Stanford Univ Dept Pediat Sch Med Palo Alto CA 94305 USA Tech Univ Berlin Dept Telecommun Syst D-10623 Berlin Germany

We study a multihop "virtual" full-duplex relay channel as a special case of a general multiple multicast relay network. For such a channel, quantize-map-and-forward (QMF) [and its generalization of noisy network coding (NNC) and short message NNC] achieves the cut-set upper bound within a constant additive gap, where the gap grows linearly with the number of relay stages K. This gap, however, may not be acceptable for practical communication systems with multihop transmissions (e.g., a wireless backhaul operating at high frequencies). Recently, we improved the capacity scaling by using a forward sliding-window (SW) decoding and by optimizing the quantization level at each relay, obtaining the gap that grows logarithmically as log K. Furthermore, the improved scheme has lower decoding complexity and delay than the general QMF and NNC approaches. In this paper, we further improve the performance by presenting a mixed scheme in which each relay can perform either decode-and-forward (DF) or the improved QMF (with SW decoding) and can choose to perform rate-splitting to enable partial interference cancellation. In general, the optimization of the relay DF/QMF configuration is combinatorial. Nevertheless, we provide that a simple greedy algorithm finds an optimal configuration under some practically reasonable assumptions. We derive an achievable rate that is easily computable and show that the proposed mixed scheme outperforms the QMF-only schemes. We demonstrate that the performance improvement increases with K, which indicates that the mixed scheme is indeed beneficial for multihop transmission.

关键词： Multihop relay networks half-duplex relays quantize-map-and-forward noisy network coding wireless backhaul

来源：评论

学校读者我要写书评

暂无评论

Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap

引用

IEEE COMMUNICATIONS LETTERS 2012年第1期16卷 2-5页

作者： Zhou, Lei Yu, Wei Univ Toronto Edward S Rogers Sr Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay channel can be achieved to within a constant gap of 1/2 log(2)(3) = 0.7925 bits using a modified version of the noisy network coding strategy, where the quantization level at the relay is set in a correlation dependent way. As a corollary, this letter establishes that the conventional compress-and-forward scheme also achieves to within a constant gap to the capacity. In contrast, the decode-and-forward and the single-tap amplify-and-forward relaying strategies can have an infinite gap to capacity in the regime where the noises at the relay and at the destination are highly correlated, and the gain of the relay-to-destination link goes to infinity.

关键词： Approximate capacity noise correlation noisy network coding relay channel

来源：评论

学校读者我要写书评

暂无评论

Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels

引用

IEEE COMMUNICATIONS LETTERS 2012年第10期16卷 1529-1531页

作者： Khormuji, Majid Nasiri Skoglund, Mikael Royal Inst Technol KTH Sch Elect Engn SE-10044 Stockholm Sweden Royal Inst Technol KTH ACCESS Linnaeus Ctr SE-10044 Stockholm Sweden

We investigate memoryless multiple-access relay channels (MARCs) and establish the capacity of two semideterministic classes of such channels: MARCs with orthogonal receive components and state-decoupled MARCs. For both cases, the achievability and converse are proved using the noisy network coding lower bound and the cutset upper bound, respectively. Finally, the capacity of a MARC with additive Gaussian interference is quantified.

关键词： Capacity noisy network coding multiple-access relay channels channels with state and additive interference

来源：评论

学校读者我要写书评

暂无评论

Joint Decompression and Decoding for Cloud Radio Access networks

引用

IEEE SIGNAL PROCESSING LETTERS 2013年第5期20卷 503-506页

作者： Park, Seok-Hwan Simeone, Osvaldo Sahin, Onur Shamai (Shitz), Shlomo New Jersey Inst Technol CWCSPR ECE Dept Newark NJ 07102 USA InterDigital Inc Melville NY 11747 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

In this work, joint decompression and decoding is studied for the uplink of multi-antenna cloud radio access networks. In this system, a set of multi-antenna mobile stations (MSs) wish to communicate with a "cloud" decoder through a set of multi-antenna base stations (BSs), which are connected to the cloud decoder through digital backhaul links of limited capacity. The BSs compress the received signal and send it to the cloud decoder, which performs joint decoding of the signals from all MSs. While the conventional solution prescribes that the cloud decoder performs first decompression and then decoding, recent work has shown that potentially larger rates can be achieved with joint decompression and decoding (JDD) at the cloud decoder. The sum-rate maximization problem with JDD, under the assumption of Gaussian test channels, is shown here to be an instance of a class of non-convex problems known as Difference of Convex (DC) problems. Based on this observation, an iterative algorithm based on the Majorization Minimization (MM) approach is proposed that guarantees convergence to a stationary point of the sum-rate maximization problem. Numerical results demonstrate the advantage of the proposed algorithm compared to the conventional approach based on separate decompression and decoding.

关键词： Cloud radio access networks distributed source coding multi-cell processing noisy network coding

来源：评论

学校读者我要写书评

暂无评论

Leveraging Strictly Causal State Information at the Encoders for Multiple Access Channels

Leveraging Strictly Causal State Information at the Encoders...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Li, Min Simeone, Osvaldo Yener, Aylin Penn State Univ Dept Elect Engn University Pk PA 16802 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781457705953

The state-dependent multiple access channel (MAC) is considered where the state sequences are known strictly causally to the encoders. First, a two-user MAC with two independent states each known strictly causally to one encoder is revisited, and a new achievable scheme inspired by the recently proposed noisy network coding is presented. This scheme is shown to achieve a rate region that is potentially larger than that provided by recent work for the same model. Next, capacity results are presented for a class of channels that include modulo-additive state-dependent MACs. It is shown that the proposed scheme can be easily extended to an arbitrary number of users. Finally, a similar scheme is proposed for a MAC with common state known strictly causally to all encoders. The corresponding achievable rate region is shown to reduce to the one given in the previous work as a special case for two users.

关键词： Decoding Encoding Markov processes Noise measurement Silicon Transmitters arbitrary number channel coding encoders leveraging strict causal state information modulo-additive state-dependent MAC multi-access systems noisy network coding state-dependent multiple access channel wireless channels

来源：评论

学校读者我要写书评

暂无评论

An Improved Achievable Secrecy Rate for the Relay-Eavesdropper Channel

An Improved Achievable Secrecy Rate for the Relay-Eavesdropp...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Xu, Peng Ding, Zhiguo Dai, Xuchu Leung, Kin K. Univ Sci & Tech China Dept Elec Eng & Info Sci Hefei 230027 Anhui Peoples R China Newcastle Univ Sch Elect Elect & Comp Engn Newcastle Upon Tyne NE1 7RU Tyne & Wear England Imperial Coll London Dept Elect & Elect Engn London SW7 2BT England

ISBN: (纸本)9781467359399;9781467359382

This paper study information-theoretic security for a four-node relay-eavesdropper channel. We propose a new achievable scheme whose key idea is to combine noisy network coding for relay channels and the interference assisted strategy for wiretap channel with a helping interferer. The corresponding achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. The previous interference assisted schemes such as noise-forwarding and cooperative jamming are shown to be special cases of the proposed scheme. Moreover, in some very strong eavesdropping case where these interference assisted schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still achieve a positive secrecy rate.

关键词： Relay-eavesdropper channel information theoretic secrecy noisy network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：