检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学移动通信技术重点实验室,重庆400065
出 处:《计算机应用研究》2010年第2期646-648,共3页Application Research of Computers
基 金:国际科技合作计划资助项目(2008DFA12110);新世纪优秀人才支持计划资助项目(NCET-06-0778);重庆市自然科学基金资助项目(CSTC;2007BB2390;2008BB2413)
摘 要:针对协同蜂窝网中基于发送量化信道状态信息的中继选择方案下,目的节点需要不停地获取所有中继处第一跳的信道信息而引起的系统开销问题,提出了一种基于自适应量化信道状态信息的机会中继选择方案。新方案下,仅在第一跳的瞬时信道条件高于预先设置的门限值时,各候选中继发送量化后的信道信息比特。仿真结果表明,改进方案在对系统性能影响不大的同时可以获得较高的比特利用率。同时,随着候选中继数从3增加至5时,中继点处设置的发送门限值可相应从0.267 1提升至0.575 6,这表明新方案具有较好的鲁棒性。In order to deal with the system overhead problem induced by transmit quantized bits of the first hop channel state information for destination to obtain global channel state information, this paper proposed the relay selection scheme based on adaptively transmitting the quantization bits of instantaneous channel state information. In the improved scheme, the candidate relayed transmit the quantized bits of the first hop channel state information only when the instantaneous channel condition was better than the threshold which was set in advance. Simulation result shows that the new scheme can improve the bit utilize efficiency and at the same time has little influence on the bit error rate of the system. Moreover, as the number of candidate relays increases from three to five, the appropriate threshold ranges from 0.267 1 to 0.575 6, this resuh shows that the improved scheme has robustness performance.
关 键 词:协同分集 虚拟天线阵列 量化信道状态信息 机会中继选择 比特利用率
分 类 号:TP393.03[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15