检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Lou Jia Luo Tao Yue Guangxin
出 处:《High Technology Letters》2011年第4期344-349,共6页高技术通讯(英文版)
基 金:Supported by the National Natural Science Foundation of China (No. 60872049; 60871042; 60971082; 60972073), the National High Technology Research and Development Programme of China (No.2007AA10Z235)and the National Key Basic Research Program of China (No.2009CB320407).
摘 要:This paper considers a two-user Gaussian interference channel aided by a single relay. Two source-destination pairs and the relay share a single common chaunel, and the relay assists both sources in communicating the messages to their respective destinations. This paper mainly focuses on the "amplify-and-forward" (AF) relaying strategy for relay, and derives upper bound and lower bound on achievable sum rate accordingly. Next, the application of the above model in cognitive radio (CR) networks is considered. The schemes that can ensure the coexistence of the secondary user with the primary user are proposed, in the sense that there is no rate degradation for the primary user due to sharing of the channel. Further, the throughput of the secondary user in different communication scenarios is investigated.
关 键 词:interference channel RELAY achievable sum rate cognitive radio(CR) THROUGHPUT
分 类 号:TP333.35[自动化与计算机技术—计算机系统结构] TN913.3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.52.13