检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学移动通信国家重点实验室,南京210096
出 处:《Journal of Southeast University(English Edition)》2008年第1期1-5,共5页东南大学学报(英文版)
基 金:The National High Technology Research and Develop-ment Program of China(863 Program)(No.2006AA01Z268);the NationalNatural Science Foundation of China(No.60496311).
摘 要:Taking the time varying nature of wireless channels into account, two user selection schemes with lower complexity are developed for multiple-input multiple-output broadcast (MIMO BC)systems. According to the relationship between coherence time and Doppler frequency, an information frame is divided into several segments. At the beginning of each segment, the user selection is carded out with the greedy selection algorithm. In the simplified user selection algorithms employing the temporal correlation (SUSTC), the selection results are applied for all the remaining slots in each segment. But in the improved simplified user selection algorithms employing the temporal correlation(ISUSTC), at the remaining slots, users are kept with favorable channel conditions selected at the previous slot, and other users are updated from the candidate pool to communicate simultaneously. Simulations show that compared with the greedy user selection method, the proposed algorithms can reduce the selection complexity with a little sum capacity loss.考虑无线信道的时间相关性,提出了2种多天线广播系统中降低复杂度的用户选择方案.根据信道相干时间和多普勒频率的关系,将发送信息序列划分为数据段.在每个数据段的开始时刻,利用贪婪用户选择算法做选择.在基于时间相关的用户选择算法SUSTC中,其余时隙仍然保持该段开始时刻的选择结果.而在改进的基于时间相关的用户选择算法ISUSTC中,在其余时刻,保留信道条件较好的一些用户仍被选中,然后在备选用户集合中更新其他用户.仿真结果表明,与贪婪用户选择方法相比,所提出的算法降低了用户选择复杂度而只需损失少许系统和容量.
关 键 词:user selection multiple-input multiple-outputbroadcast temporal channel correlation
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117