检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Fu Hongliang Feng Guangzeng
机构地区:[1]Nanjing University of the Posts and Telecommunications, Nanjing 210003, China [2]Henan University of Technology, Zhengzhou 450052, China
出 处:《Journal of Electronics(China)》2006年第2期161-164,共4页电子科学学刊(英文版)
基 金:Supported by the National Natural Science Foundation of China (No.60472104);Doctoral innovative fund of Jiangsu province (xm04-32).
摘 要:Two blind multiuser detection algorithms for antenna array in Code Division Multiple Access (CDMA) system which apply the linearly constrained condition to the Least Squares Constant Modulus Algorithln (LSCMA) are proposed in this paper. One is the Linearly Constrained LSCMA (LC-LSCMA), the other is the Preprocessing LC-LSCMA (PLC-LSCMA). The two algorithms are compared with the conventional LSCMA. The results show that the two algorithms proposed in this paper are superior to the conventional LSCMA and the best one is PLC-LSCMA.Two blind multiuser detection algorithms for antenna array in Code Division Multiple Access (CDMA) system which apply the linearly constrained condition to the Least Squares Constant Modulus Algorithm (LSCMA) are proposed in this paper. One is the Linearly Constrained LSCMA (LC-LSCMA), the other is the Preprocessing LC-LSCMA (PLC-LSCMA). The two algorithms are compared with the conventional LSCMA. The results show that the two algorithms proposed in this paper are superior to the conventional LSCMA and the best one is PLC-LSCMA.
关 键 词:Antenna array MultiUser Detection (MUD) Code Division Multiple Access (CDMA) Least Squares Constant Modulus Algorithm (LSCMA) Linearly Constrained LSCMA (LC-LSCMA) Preprocessing LC-LSCMA (PLC-LSCMA)
分 类 号:TN914.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229