检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王华华[1] 曹磊 罗一丹 WANG Huahua;CAO Lei;LUO Yidan(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065
出 处:《无线电工程》2024年第5期1247-1254,共8页Radio Engineering
基 金:重庆市自然科学基金(cstc2021jcyi-msxmX0454)。
摘 要:采用有少量反相器和开关(Inverter and Switch,IS)组合的预编码架构设计模拟预编码部分,相比传统移相器结构的混合预编码可以有效降低系统功耗。利用此结构的混合预编码在计算收发端最优的编码矩阵时会变成一个求解复杂的离散组合问题。针对多天线多用户的毫米波大规模多输入多输出(Multiple Input Multiple Output,MIMO)场景,提出了一种新的优化方案——SVD_CE,可将2个矩阵的联合优化问题转化为2个独立的组合优化问题,基于改进交叉熵(Cross Entropy,CE)算法分别求解编解码矩阵。仿真结果表明,所提方案与已有解决方案相比不会造成系统性能的损失,在取得相同性能时利用CE算法中所需候选集的数量大幅减少,有效降低了求解的复杂度。The precoding architecture with a few inverters and switches(IS)is used to design the analog precoding part,which can effectively reduce the power consumption of the system compared with the traditional phase shifter structure of the hybrid precoding.The hybrid precoding using this structure becomes a complex discrete combination problem when calculating the optimal encoding matrix at the receiving and sending ends.A new optimization scheme SVD_CE is proposed for multi-antenna and multi-user Multiple Input Multiple Output(MIMO)scenarios,which can transform the joint optimization problem of two matrices into two independent combinative optimization problems.Then the codec matrix is solved based on the improved Cross Entropy(CE)algorithm.The simulation results show that compared with the existing solutions,the proposed scheme will not cause the loss of system performance,and when the same performance is achieved,the number of candidate sets required by the CE algorithm in this scheme is greatly reduced,which effectively reduces the complexity of solution.
关 键 词:毫米波 大规模多输入多输出 混合预编码 交叉熵算法 奇异值分解
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.106.2