Fast Convergence on Blind and Semi-Blind Channel Estimation for MIMO-OFDM Systems

摘要

In this paper, blind and semi-blind subspace channel estimations with fast convergence rate are proposed for multiple-input multiple-output orthogonal frequency division multiplexing (OFDM) systems in the presence of virtual carriers. The subspace method has a main drawback of slow convergence rate when deriving the noise subspaces from the second-order statistics of received signals. This phenomenon is especially evident when the size of received signals is large. Inspired by this fact, we present a block matrix scheme (BMS) to generate a group of sub-vectors from each OFDM symbol when virtual carriers are used. The number of equivalent signals is increased and therefore, the convergence rate of channel estimation is enhanced. The semi-blind method is also investigated by incorporating subspace technology with least square scheme. The identifiability of the BMS-based channel estimation is analyzed to derive the applicable range of the BMS size. The computational complexity of the proposed channel estimation is calculated at the end. Computer simulations show that the proposed blind and semi-blind methods converge very well in channel estimation and equalization.