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

Improved Transmission Strategies for Cognitive Radio Under the Coexistence Constraint

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2012年第11期11卷 4058-4073页

作者： Lin, Pin-Hsun Lin, Shih-Chun Su, Hsuan-Jung Hong, Y. -W. Peter Natl Taiwan Univ Dept Elect Engn Taipei 10617 Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei 10617 Taiwan Natl Taiwan Univ Sci & Technol Dept Elect & Comp Engn Taipei 10607 Taiwan Natl Tsing Hua Univ Inst Commun Engn Hsinchu 30013 Taiwan

In this work, we consider an interference-mitigation based cognitive radio system where a secondary transmitter is to communicate with its corresponding receiver without affecting the communication between a primary transmitter-receiver pair. In this case, the secondary transmitter must satisfy a coexistence constraint which requires that no rate degradation occurs at the primary user (PU), even when the latter utilizes only a single-user decoder. To achieve a non-zero rate of the secondary user (SU) under this constraint, Jovicic and Viswanath previously proposed a scheme (referred to as the JV scheme) that utilizes relaying by the secondary transmitter to overcome the interference caused by the simultaneous transmission of the SU's message. In this case, the interference caused by the signals corresponding to PU's message at the secondary receiver (from both the direct and the relay links) is mitigated by employing dirty paper coding (DPC) at the secondary transmitter. However, the interference caused by the SU's message at the primary receiver is not eliminated in this case and, thus, will limit the power (and, hence, the rate) that can be used by the secondary transmitter to transmit its own message. In our work, the use of clean relaying by the secondary transmitter and/or receiver (i.e., relaying without simultaneous transmission of SU's own message) is proposed to improve the quality of the relayed signal and, thereby, increases the rate achievable by the SU. Two improved transmission schemes are proposed: (i) clean relaying by secondary transmitter (CT) and (ii) clean relaying by secondary transmitter and receiver (CTR). The CT scheme utilizes DPC to mitigate interference at the secondary receiver whereas the CTR scheme utilizes coding for multiple access channels with common messages to enable decoding of both PU's and SU's messages at the secondary receiver. The CT scheme can be viewed as a generalization of the JV scheme and, therefore, performs at least

关键词： Cognitive radio Coexistence constraint Clean relaying Transmitter relaying Receiver relaying Partial CSIT Dirty paper coding gelfand-pinsker coding

来源：评论

学校读者我要写书评

暂无评论

A Unified Graphical Approach to Random coding for Single-Hop Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第1期62卷 56-88页

作者： Rini, Stefano Goldsmith, Andrea Natl Chiao Tung Univ Dept Commun Engn Hsinchu 30010 Taiwan Stanford Univ Dept Elect Engn Stanford CA 94305 USA

A unified graphical approach to random coding for any memoryless, single-hop, K-user channel with or without common information is defined through two steps. The first step is user virtualization. Each user is divided into multiple virtual sub-users according to a chosen rate-splitting strategy. This results in an enhanced channel with a possibly larger number of users for which more coding possibilities are available and for which common messages to any subset of users can be encoded. Following user virtualization, the message of each user in the enhanced model is coded using a chosen combination of coded time-sharing, superposition coding, and joint binning. A graph is used to represent the chosen coding strategies. Nodes in the graph represent codewords, while edges represent coding operations. This graph is used to construct a graphical Markov model, which illustrates the statistical dependence among codewords that can be introduced by the superposition coding or joint binning. Using this statistical representation of the overall codebook distribution, the error probability of the code is shown to vanish through a unified analysis. The rate bounds that define the achievable rate region are obtained by linking the error analysis to the properties of the graphical Markov model. This proposed framework makes it possible to numerically obtain an achievable rate region by specifying a user virtualization strategy and describing a set of coding operations. The union of these rate regions defines the maximum achievable rate region of our unified coding strategy. The achievable rates obtained based on this unified graphical approach to random coding encompass the best random coding achievable rates for all memoryless single-hop networks known to date, including broadcast, multiple access, interference, and cognitive radio channels, as well as new results for topologies not previously studied, as we illustrate with several examples.

关键词： Wireless network random coding achievable rate region user virtualization chain graph graphical Markov model coded time-sharing rate-splitting superposition coding binning gelfand-pinsker coding

来源：评论

学校读者我要写书评

暂无评论

Cognitive interference channel: achievable rate region and power allocation

引用

IET COMMUNICATIONS 2015年第2期9卷 249-257页

作者： Al-qudah, Zouhair Al Bataineh, Mohammad Al Hussein bin Talal Univ Dept Elect & Commun Engn Maan Jordan Yarmouk Univ Telecommun Engn Dept Irbid Jordan

In this study, the authors consider a state-dependent two user interference channel. The two users sharing the spectrum are assumed to be cognitive and each user has a non-causal access to the signal from the other user. For this channel model, an achievable rate region is established for both discrete memoryless model and Gaussian channel. In particular, the achievable rate region is obtained by combining Han-Kobayashi rate splitting coding scheme, superposition coding, gelfand-pinsker coding scheme and zero-forcing dirty paper coding. Furthermore, the sum rate maximisation and the associated power allocation problem are studied, numerically and theoretically. The corresponding numerical examples show that the proposed combined coding scheme outperforms the existing schemes in the sense of achievable rate region. Moreover, the effectiveness of the optimal power allocation between the two cognitive nodes is also shown.

关键词： channel coding radiofrequency interference Gaussian channels resource allocation zero-forcing dirty paper coding gelfand-pinsker coding superposition coding Han-Kobayashi rate splitting coding scheme Gaussian channel discrete memoryless model two-user interference channel power allocation achievable rate region cognitive interference channel

来源：评论

学校读者我要写书评

暂无评论

State-Dependent Broadcast Channels with Reversible Input Constraints

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2024年第2期26卷 158-165页

作者： Ramachandran, Viswanathan KTH Royal Inst Technol Sch Elect Engn & Comp Sci Stockholm Sweden

joint message communication and input reconstruction problem over a two-user state-dependent degraded discrete-memoryless broadcast channel is considered. The state process is assumed to be independent and identically distributed (i.i.d.), and known non-causally at the transmitter as well as the non-degraded receiver. The two receivers have to decode the messages from the transmitter, while the degraded receiver also needs to estimate the channel input codeword to meet a prescribed distortion limit. A complete characterization of the optimal rates versus distortion performance is provided. The tight characterization is also illustrated by means of an example of an additive binary broadcast channel with a Hamming distortion constraint for the input reconstruction at the degraded receiver.

关键词： Broadcast channel codeword reconstruction constrained communication gelfand-pinsker coding Hamming distortion rate-distortion state-dependent channel

来源：评论

学校读者我要写书评

暂无评论

Multiple Access Channels With Combined Cooperation and Partial Cribbing

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第2期62卷 825-848页

作者： Kopetz, Tal Permuter, Haim H. Shamai, Shlomo (Shitz) Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel Technion Israel Inst Technol Dept Elect Engn IL-3200003 Haifa Israel

In this paper, the multiple access channel (MAC) with combined cooperation and partial cribbing is studied, and its capacity region is characterized. Cooperation means that each of the two encoders sends a message to the other via a ratelimited link prior to transmission, while partial cribbing means that each of the two encoders obtains a deterministic function of the other encoder's output with or without delay. Prior work in this field dealt separately with cooperation and partial cribbing, but by combining these two methods, we can achieve significantly higher rates. Surprisingly, the capacity region of the MAC with combined cooperation and partial cribbing can be expressed using only one auxiliary random variable (RV) similar to the capacity regions of the MAC with cooperation and with partially cribbing encoders. The reason is that in an optimal coding scheme, the encoders use both cooperation and partial cribbing to generate a common message between the encoders. Furthermore, the Gaussian MAC with combined one-sided cooperation and quantized cribbing is studied. For this model, an achievability scheme is given. This scheme shows how many cooperation or quantization bits are required to practically achieve the capacity region of the Gaussian MAC with full message cooperation or perfect cribbing. To ratify the main results, two additional models are studied. In both models, only one auxiliary RV is needed. The first is a rate distortion dual setting for the MAC with degraded message set and combined cooperation and cribbing. The second is a state-dependent MAC with cooperation, where the state is known at a partially cribbing encoder and at the decoder. However, there are cases where more than one auxiliary RV is needed, e. g., when the cooperation and the cribbing are not used for the same purposes. The MAC with an action-dependent state is presented, where the action is based on the cooperation but not on the cribbing. Therefore, in this case, more than one a

关键词： Action block Markov coding cooperation duality double rate splitting Gaussian MAC gelfand-pinsker coding multiple access channels partial cribbing state

来源：评论

学校读者我要写书评

暂无评论

A Lego-Brick Approach to coding for Network Communication

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第2期70卷 865-903页

作者： Ghaddar, Nadim Ganguly, Shouvik Wang, Lele Kim, Young-Han Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G8 Canada Samsung Res Amer Plano TX 75023 USA Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that the point-to-point codes satisfy certain properties pertaining to the rate, the error probability, and the distribution of decoded sequences, bounds on the performance of the coding schemes are derived and shown to hold irrespective of other properties of the codes. In particular, we consider the problems of lossless and lossy source coding, Slepian-Wolf coding, Wyner-Ziv coding, Berger-Tung coding, multiple description coding, asymmetric channel coding, gelfand-pinsker coding, coding for multiple access channels, Marton coding for broadcast channels, and coding for cloud radio access networks (C-RAN's). We show that the coding schemes can achieve the best known inner bounds for these problems, provided that the constituent point-to-point channel codes are rate-optimal. This would allow one to leverage commercial off-the-shelf codes for point-to-point symmetric channels in the practical implementation of codes over networks. Simulation results demonstrate the gain of the proposed coding schemes compared to existing practical solutions to these problems.

关键词： Network information theory channel coding Slepian-Wolf coding gelfand-pinsker coding Wyner-Ziv coding Berger-Tung coding multiple description coding Marton coding multiple access channels cloud radio access networks

来源：评论

学校读者我要写书评

暂无评论

On the Capacity of the Noncausal Relay Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第6期63卷 3554-3564页

作者： Wang, Lele Naghshvar, Mohammad Stanford Univ Dept Elect Engn Stanford CA 94305 USA Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA Qualcomm Technol Inc San Diego CA 92121 USA

This paper studies the noncausal relay channel, also known as the relay channel with unlimited look ahead, introduced by by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on the previous received output symbols, the relay in the noncausal relay channel encodes its signal as a function of the entire received sequence. In the existing coding schemes, the relay uses this noncausal information solely to recover the transmitted message or part of it and then cooperates with the sender to communicate this message to the receiver. However, it is shown in this paper that by applying the gelfand-pinsker coding scheme, the relay can take further advantage of the noncausally available information and achieve rates strictly higher than those of the existing coding schemes. This paper also provides a new upper bound on the capacity of the noncausal relay channel that strictly improves upon the existing cutset bound. These new lower and upper bounds on the capacity coincide for the class of degraded noncausal relay channels and establish the capacity for this class.

关键词： Relay channel gelfand-pinsker coding decoding-forward relaying compress-forward relaying cutset bound

来源：评论

学校读者我要写书评

暂无评论

Multicasting Messages over Gaussian Broadcast Channels with Receiver Message Side Information

Multicasting Messages over Gaussian Broadcast Channels with ...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Sima, Jin Chen, Wei Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol TNList Beijing Peoples R China

ISBN: (纸本)9781467377041

The problem of multicasting multi-messages over Gaussian broadcast channels with receiver message side information is investigated for K = 3 receivers. The problem generalizes various broadcasting scenarios where the receivers have some message side information, including broadcasting with common message. Based on rate splitting, network coding and gelfand-pinsker coding, a successive coding scheme is proposed, such that the network coded messages are successively decoded while the interference from previous decoded messages are simultaneously canceled at receivers. The optimal decoding order and power-rate allocation for maximizing the weighted sum-rate is derived. An outer bound of the capacity region is also established.

关键词： Gaussian Broadcast Channels Message Side Information Capacity Region gelfand-pinsker coding Network coding

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv coding over Broadcast Channel with Noncausal Channel Side Information only Known at Encoder

引用

International Conference on Information Technology for Manufacturing Systems (ITMS 2011)

作者： Wang, Da-Jin Xue, Guangda Yan, Guiliang Tsinghua Univ Beijing 100084 Peoples R China

ISBN: (纸本)9783037851494

We consider the problem of transmitting common message over discrete memoryless broadcast channel (DM-BC) with noncausal discrete memoryless (DM) channel side information (CSI) only known at encoder. Nayak, etc. consider this problem and give a scheme combining Wyner-Ziv coding and gelfand-pinsker coding. The gelfand-pinsker's code is optimal for point-to-point communication with the encoder accessed to noncausal CSI. But Nair, etc., show that the straightforward extension of gelfand-pinsker's code to DM-BC with DM state is not optimal. In this paper, the inner bound of transmitting common message over DM-BC with noncausal DM-CSI only known at encoder is given. The proof of achievability uses Wyner-Ziv coding, gelfand-pinsker coding, superposition coding, Marton coding and indirect decoding.

关键词： Channel side information memoryless broadcast channel Wyner-Ziv coding gelfand-pinsker coding indirect decoding Marton coding

来源：评论

学校读者我要写书评

暂无评论

Multiple Access Channels with Combined Cooperation and Partial Cribbing

Multiple Access Channels with Combined Cooperation and Parti...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kopetz, Tal Permuter, Haim H. Shamai (Shitz), Shlomo Ben Gurion Univ Negev IL-84105 Beer Sheva Israel

ISBN: (纸本)9781479951864

In this paper we study the multiple access channel (MAC) with combined cooperation and partial cribbing and characterize its capacity region. Cooperation means that the two encoders send a message to one another via a rate-limited link prior to transmission, while partial cribbing means that each of the two encoders obtains a deterministic function of the other encoder's output with or without delay. Prior work in this field dealt separately with cooperation and partial cribbing. However, by combining these two methods we can achieve significantly, higher rates. Remarkably, the capacity region does not require an additional auxiliary random variable (RV) since the purpose of both cooperation and partial cribbing is to generate a common message between the encoders. In the proof we combine methods of block Markov coding, backward decoding, double rate-splitting, and joint typicality decoding. Furthermore, we present the Gaussian MAC with combined one-sided cooperation and quantized cribbing. For this model, we give an achievability scheme that shows how many cooperation or quantization bits are required in order to achieve a Gaussian MAC with full cooperation/cribbing capacity region. After establishing our main results, we show that in a state-dependent MAC with cooperation, where the state is known at a partially cribbing encoder and at the decoder, only one auxiliary RV is needed to incorporate both the cribbing and the cooperation. However, there are cases where more than one auxiliary RV is needed, e.g., when the cooperation and cribbing are not used for the same purposes. We present a MAC with an action-dependent state where the action is based on the cooperation but not on the cribbing. Therefore, in this case more than one auxiliary RV is needed. We deduce a general rule for this result.

关键词： Action Block Markov coding Cooperation Double rate splitting Gaussian MAC gelfand-pinsker coding Multiple access channels Partial cribbing State

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：