检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学移动通信技术重点实验室,重庆400065 [2]重庆大学通信工程学院,重庆400044
出 处:《重庆大学学报(自然科学版)》2012年第12期144-148,162,共6页Journal of Chongqing University
基 金:国家科技重大专项(2011ZX03003-003-02);国家自然科学基金资助项目(60972070;61171111);重庆市自然科学基金资助项目(CSTC2009BA2090);重庆市教委资助项目(KJ100514);重庆邮电大学博士启动基金(A2011-2)
摘 要:基于最大信道增益的中继选择方法,分析了在不完全信道状态信息(CSI,channel stateinformation)和受主用户干扰情况下认知中继网络的中断概率;进一步提出了在主用户干扰约束和保证认知用户服务质量(QoS,quality of service)条件下最大化认知中继网络频谱效率的数学优化模型,利用拉格朗日对偶松弛法获得了该优化问题的解,在保证主用户传输性能不受影响的前提下,提高了认知中继网络的频谱效率。仿真结果表明该文提出的功率分配方案与等功率分配方案相比提高了性能增益。同时表明在非完全信道条件下获得的频谱效率与完全信道条件下的频谱效率近似,但减少了系统信息的反馈量和实现的复杂度,有利于该方案的工程应用。Considering the interference introduced by primary user,the outage probability of cognitive relay networks under imperfect channel state information is analyzed based,on the relay selection for the maximum channel gain.In addition,the mathematical optimization model of maximizing the spectrum efficiency under the interference constraint of primary user and the QoS requirement of cognitive user is proposed for cognitive relay networks.Then,the optimal solution of the model is obtained with the Lagrangian method.The proposed scheme improves the spectrum efficiency of cognitive relay networks on the premise of guaranteeing the transmission performance of primary user.Simulation results show that the proposed power allocation scheme improves the system performance compared with the traditional equal power allocation scheme.Meanwhile,it indicates that the approximate spectrum efficiency can be obtained under the perfect channel state and the imperfect channel state.Under the imperfect channel state,the feedback information and the complexity of implementation will be reduced,which is beneficial to the engineering application.
关 键 词:认知中继网络 不完全信道状态信息 中继选择 功率分配
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200