检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学信息科学与工程学院,上海200433 [2]国立清华大学通讯工程研究所,中国台湾新竹30013
出 处:《计算机工程》2015年第1期71-74,81,共5页Computer Engineering
摘 要:近年来迭代干扰对齐技术得到了较多的关注,通过迭代干扰对齐算法可设计线性预编码矩阵,以最大化多输入多输出系统的总速率。但目前将自由度(Do F)分配方式作为系统总速率影响因素的研究较少。为此,提出一种Do F分配算法,通过改进模拟退火算法从而得到可使系统总速率达到最大的Do F分配方式。Do F分配问题是组合优化问题,采用模拟退火算法可较好地解决该问题。仿真结果表明,该算法所获得的系统总速率接近遍历算法的性能,具有更低的复杂度。尤其当系统变得复杂(用户数目增加,或者天线数目增加)时,改进模拟退火算法的低复杂度优势更为明显。This paper considers the joint interference alignment and allocation of Degrees of Freedom(Do F)in multiple access K-user Multiple-Input Multiple-Output(MIMO)interference channel to maximize the sum capacity.Because a set of linear precode and corresponding combining matrices can be designed to maximize the sum rate,while joint consideration of sum capacity and distribution of Do F is less addressed. Therefore,this paper proposes an improved Do F allocation algorithm to search ideal Do F allocation which can maximize the sum rate. The essence of Do F allocation is a combinational optimization problem. SA algorithm has notable advantage over this. Simulation results show that the proposed modified SA algorithm achieves sum rate performance near that of the Exhausting search(EX)asymptotically,while the SA has lower computation complexity. Especially,when the system becomes more complicated(increasing user numbers or antennas),the low complexity advantage of SA algorithm is much more notable.
关 键 词:多输入多输出 迭代干扰对齐 自由度分配 模拟退火算法 总速率
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3