一种有效的正交化恒模算法

北京邮电大学学报 ›› 2002, Vol. 25 ›› Issue (1): 30-33.

一种有效的正交化恒模算法

郭艳^1,2,方大纲¹,梁昌洪²

1.南京理工大学毫米波技术实验室, 南京 210094;
2.西安电子科技大学天线与微波国防重点实验室, 西安 710071

收稿日期:2001-04-03 出版日期:2002-01-10
作者简介: 郭艳(1971—),女,博士生,讲师
基金资助:

Effective Orthogonal Constant Modulus Algorithm

GUO Yan^1,2, FANG Da-gang¹, LIANG Chang-hong²

1. Department of Communication Engineering, Nanjing University of Science and Technology, Nanjing 210094, China;
2.Defense Key Laboratory on Antennas and Microwaves, Xidian University, Xi'an710071, China

Received:2001-04-03 Online:2002-01-10
Supported by:

摘要/Abstract

摘要： 利用奇异值分解确定了用户信号的个数,并把天线阵接收的数据矩阵映射到信号子空间上,进而在该空间中讨论波束形成问题并导出了多用户波束形成的必要条件,依据此条件将正交化过程引入最小二乘恒模算法并提出了正交化恒模算法。计算机仿真证实了算法的有效性。

关键词: 盲波束形成, 正交化, 恒模算法

Abstract: The number of desired signals is detected by using singular value decomposition. And the array input is transformed into the signal subspace. Orthogonality is derived for the weight vectors in multiple beamforming on this subspace. According to which, an orthogonal constant modulus algorithm is proposed by introducing the orthonormalization procedure into the static least square constant modulus algorithm. The simulation results via computer confirm its validity.

Key words: blind beamforming, orthogonalization, constant modulus algorithm

中图分类号:

TN911.7

郭艳,方大纲,梁昌洪. 一种有效的正交化恒模算法[J]. 北京邮电大学学报, 2002, 25(1): 30-33.

GUO Yan, FANG Da-gang, LIANG Chang-hong. Effective Orthogonal Constant Modulus Algorithm[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2002, 25(1): 30-33.

[1]	洪磊, 王保升, 陈钢. 三分支机器人最小范数逆解算法[J]. 北京邮电大学学报, 2019, 42(1): 102-108.
[2]	钱华明, 刘可, 王丙子, 马俊达. 概率约束稳健恒模自适应波束形成算法[J]. 北京邮电大学学报, 2016, 39(2): 63-68.
[3]	郭志恒，李立华，陶小峰. 快速V-BLAST排序检测方法[J]. 北京邮电大学学报, 2007, 30(4): 83-87.
[4]	薛强, 蒋笑冰, 吴伟陵. 多径衰落信道下基于SE-CMA的盲自适应多用户检测算法[J]. 北京邮电大学学报, 2003, 26(1): 19-22.
[5]	张浩亮, 段炼, 薛强, 吴伟陵. 一种新的基于CMA的盲自适应多用户检测算法[J]. 北京邮电大学学报, 2003, 26(1): 78-81.