检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学无线网络通信实验室,安徽合肥230027
出 处:《中国科学技术大学学报》2014年第1期48-60,共13页JUSTC
基 金:Supported by National Natural Science Foundation of China(61171112);MIIT of China(2010ZX03005-001-02,2012ZX03001037,2010ZX03002-010-02)
摘 要:研究了多小区多用户蜂窝网络中子空间干扰对齐技术.与基于预编码与接收滤波器联合设计的传统方法不同,本文提出的方法只需要预编码参与迭代优化,这样能够避免上下行链路反复交替迭代带来的冗余开销.更重要的是我们引入了格拉斯曼流形,将优化问题在此流形上重组,降低了空间维度,提出该流形上的最陡下降沿算法达到子空间干扰对齐.仿真结果表明本文提出的方法比已有算法具有收敛速度快,系统容量高的优势.The subspace interference alignment for multi-cell and multi-user cellular networks was focused. Different from most previous algorithms that are based on a joint design of precoder and receive filter, the proposed method achieves interference alignment with precoder design only. This means our algorithm only requires the participation of transmitters, which will alleviate significantly the overhead induced by alternation between the up and down links. More importantly, varying from the traditional constrained optimization method, the precoder design on complex Grassmann manifold with lower dimensions was reformulated and a novel steepest descent algorithm was derived to achieve perfect subspace interference alignment. Simulation results suggest that the proposed algorithm has better convergence performance and higher system capacity compared with previous methods.
关 键 词:干扰对齐 多输入多输出系统 蜂窝网络 格拉斯曼流形 优化 预编码
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38