The paper proposes a framework for dense array channel estimation that establishes the connection between channel estimation and MIMO precoding. The key idea is to design the observation matrix by maximizing the mutual information between the received pilots and the wireless channels.
For the amplitude-and-phase controllable scenario, the paper proposes an "ice-filling" algorithm to design the observation matrix. This algorithm sequentially generates the optimal blocks of the observation matrix by maximizing the mutual information increment between two adjacent pilot transmissions. The paper proves that the ice-filling algorithm can be viewed as a "quantized" version of the ideal water-filling algorithm, ensuring its near-optimality.
For the phase-only controllable scenario, the paper proposes a majorization-minimization (MM) algorithm to design the observation matrix. The novelty lies in replacing the primal non-convex mutual information maximization problem with a series of tractable approximate subproblems having analytical solutions, which are solved in an alternating optimization manner.
Comprehensive analyses on the achievable mean square errors (MSEs) are provided to validate the effectiveness of the proposed designs. The paper analytically proves that the ice-filling algorithm can significantly improve the estimation accuracy compared to the random observation matrix design, and the MSE gap between water-filling and ice-filling decays quadratically with the pilot length, demonstrating the near-optimality of the ice-filling algorithm.
他の言語に翻訳
原文コンテンツから
arxiv.org
深掘り質問