This paper investigates the convergence-enhanced subspace channel estimation technique for multiple-input–multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems with or without virtual carriers (VCs). Since the perturbations of the correlation matrix… Click to show full abstract
This paper investigates the convergence-enhanced subspace channel estimation technique for multiple-input–multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems with or without virtual carriers (VCs). Since the perturbations of the correlation matrix and the noise subspace are inversely proportional to the number of OFDM symbols, the subspace channel estimation involves much computational complexity to improve the convergence speed when computing the noise subspace from the correlation matrix of the received signals. Using the block circular property of the channel matrix, the circular repetition method (CRM) is proposed to generate a group of equivalent signals for each OFDM symbol. The subspace estimation of the channel coefficients performs very well within a few OFDM symbols using these equivalent symbols for both the CP-OFDM and ZP-OFDM systems with or without VCs. The computational complexity is analyzed for the CRM-based channel estimation, which reveals that it has an almost identical complexity to the traditional method. Computer simulations demonstrate that the proposed CRM-based blind/semi-blind channel estimation achieves a lower MSE than the other methods.
               
Click one of the above tabs to view related content.