信号排列组合的子空间快速盲信道估计算法

Subspace-based Blind Channel Estimation by the Signal Permutation

针对传统子空间算法进行MIMO-OFDM信道估计时,存在收敛速度慢、鲁棒性差的问题,提出一种基于收发信号排列组合的改进子空间盲信道估计算法。该算法通过对接收端信号进行有选择地取舍,并利用取舍后接收端数据块的无关联性,对信道矩阵进行类Toeplitz扩展,然后对收发两端信号进行相应的排列组合,增大发送数据块矩阵的秩,从而实现算法的快速收敛。理论分析与仿真结果表明,与传统的子空间算法相比,本文算法在复杂度略有提高的条件下能够实现快速收敛。

There were some problems in the MIMO-OFDM channel estimation with the traditional subspace algorithms,that is slow convergence,this paper proposed an improve subspace channel estimation with the permutations and combinations of the transceiver signal. To get the no correlation between the receiver signal,this paper make some selective choice,after the class Toeplitz extensions of the channel matrix,this paper do the corresponding permutations and combinations for the sending and receiving signal instead of the cumulation of large transmission data blocks,in this way,the algorithms can get the fast increase of the matrix rank which results in a fast convergence of the algorithm. Theoretical analysis and simulation results show the better convergence of the proposed method compared with the traditional subspace algorithms with a slightly increased complexity.