检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:戴谭明 王海泉 李国彬 郑思思 DAI Tan-ming;WANG Hai-quan;LI Guo-bin;ZHENG Si-si(School of Communication Engineering,Hangzhou Dianzi University,Hangzhou 310018,China)
机构地区:[1]杭州电子科技大学通信工程学院,浙江杭州310018
出 处:《软件导刊》2019年第3期173-177,共5页Software Guide
基 金:国家自然科学基金项目(61728105;61372093)
摘 要:针对基站端配置M根发送天线,而用户端只有一根接收天线的多用户多天线频分双工(frequency divi?sion duplex,FDD)下行系统,结合预编码与空时码技术,提出一种新的传输方案及相应解码方法,将用户间干扰转化为信道增益且保持线性解码复杂度。即当用户数K=2时,采用Alamouti正交空时码传送方案,而在K≤2的情况下,采用循环矩阵形式的传送方案,并与预编码技术相结合采用新的传输方案。相较于传统传送方案,该方案能有效将用户间的干扰信道信息转化为对主用户有益的信息,与此同时保持线性解码的复杂度。数值仿真结果表明,该传送方案比传统传送方案在误码率和容量上均有所提升。For a multi-user FDD downlink system where the base station has M transmit antennas and the user has only one antenna,a new transmission scheme and the corresponding decoding method are proposed based on the combination of the precoding technique and the space-time coding technique.The proposed scheme can realize the function of converting user's interference into channel gain,while it can maintain the linear decoding complexity.Specifically,when the number of users,denoted as K,is equal to two,the Alamouti orthogonal space-time code transmission scheme is used,and when K≥2,a transmission scheme based on a circulant matrix is adopted.Based on these space time codes,new transmission schemes are constructed in combination with the precoding techniques.Compared with the conventional transmission scheme,the proposed scheme can effectively change the user's interfering channel information into useful information.Meanwhile,it can keep linear decoding complexity.The results of numerical simulations show that the proposed scheme can efficiently improve the bit error rate and capacity of the system compared with the traditional transmission scheme.
关 键 词:多用户多天线 FDD下行系统 预编码技术 正交空时码 循环矩阵 解码复杂度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.139.238.74