检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学信息系统工程学院,郑州450002
出 处:《信号处理》2014年第1期51-57,共7页Journal of Signal Processing
基 金:国家自然科学基金项目(61072046)
摘 要:为了克服传统的子空间算法需要大量接收符号计算自相关矩阵、收敛速度慢等缺点,本文提出了一种新的快速收敛的基于子空间的盲信道估计算法。采用块矩阵方案,对信道矩阵进行分块处理,形成分块的Toeplitz矩阵,在不改变分块Toeplitz矩阵的情况下,可从堆栈的OFDM信号中形成大量的子向量,因此通过较小的接收符号就可以准确的估计接收信号的自相关矩阵。该算法继承了传统子空间算法估计准确度高、计算复杂度低等优点,又降低对信道时不变的要求,加快了算法的收敛速度。理论分析与仿真结果表明了本文方法的有效性和较好的误比特率性能。In order to overcome the shortcomings of traditional subspace algorithm that required lots of receiving symbols to compute the autoeorrelation matrix and had slow convergence and so on, this paper presented a new fast convergence of subspace-based blind channel estimation algorithm for the Multi-Input Multi-Output Orthogonal Frequency Division Muhi- plexing (MIMO-OFDM) wireless communication system. Through the block matrix scheme, the channel matrix was turned to be block Toeplitz matrix. Without changing the block Toeplitz matrices, a large number of sub-vectors were formed from the stacked OFDM signal. By using the sub-vector samples, an accurate estimation of auto-eorre|ation matrix could be ob- tained with fewer received block. The proposed method had the advantages of high estimation accuracy and low computa- tional complexity inherited from traditional subspace algorithm, but also relaxed the channel time-invariant requirement and accelerated the convergence speed. Theoretical analysis and simulation results show the effectiveness and better bit error rate performance of the proposed method.
关 键 词:正交频分复用 多输入多输出 子空间方法 盲信道估计
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28