检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中国传媒大学学报(自然科学版)》2009年第2期21-24,共4页Journal of Communication University of China:Science and Technology
摘 要:针对慢时变频率选择性MI MO OFDM(Multiple Input Multiple Output Orthogonal Frequency Division Multi-plexing)系统,提出一种低复杂度的信道估计算法。文中所用方法是STBC(space-ti me block coded)MI MO OFDM系统中一种基于EM(Expectation Maxi mization)的自适应信道估计技术。仿真结果显示在慢衰落环境下,随着用户数的增加,最小均方误差性能没有损失。与RLS(Recursive Least-Squares)算法比较,本文所提出的方法利用了Alamouti STBC编码结构,从而降低了计算复杂度。We propose a low complexity algorithm for channel estimation of Multiple Input Multi ple Output Orthogonal Frequency Division Multiplexing systems in slow time-varying frequency selective environment. The proposed algorithm was an adaptive channel estimation technique based on an expectation maximization algorithm for space-time block coded MIMO OFDM systems. Simulation results show that in slow fading environment there was no degradation in normalized mean square error as we increased the number of users. Comparing the Recursive LeastSquares algorithm, the proposed algorithm exploits the structure of Alamouti STBC codes to reduce computational complexity.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28