Ice-Filling: Near-Optimal Channel Estimation for Dense Array Systems
<|reference_start|>Ice-Filling: Near-Optimal Channel Estimation for Dense Array Systems: By deploying a large number of antennas with sub-half-wavelength spacing in a compact space, dense array systems(DASs) can fully unleash the multiplexing-and-diversity gains of limited apertures. To acquire these gains, accurate channel state information acquisition is necessary but challenging due to the large antenna numbers. To overcome this obstacle, this paper reveals that exploiting the high spatial correlation of DAS channels is crucial while designing the observation matrix for optimal/near-optimal channel estimation. Firstly, we prove that the observation matrix design is equivalent to a time-domain duality of multiple-input multiple-output precoding, which can be ideally addressed by the water-filling principle. For practical realizations, a novel ice-filling algorithm is proposed to design amplitude-and-phase controllable observation matrices, and a majorization-minimization algorithm is proposed to address the phase-only controllable case. Particularly, we prove that the ice-filling algorithm can be viewed as a ``quantized" water-filling algorithm. To support the sub-optimality of the proposed designs, we provide comprehensive analyses on the achievable mean square errors and their asymptotic expressions. Finally, numerical simulations verify that our proposed channel estimation designs can achieve the near-optimal performance and outperform existing approaches significantly.<|reference_end|>
@article{cui2024ice-filling:,
    title={Ice-Filling: Near-Optimal Channel Estimation for Dense Array Systems},
    author={Mingyao Cui, Zijian Zhang, Linglong Dai, Kaibin Huang},
    journal={arXiv preprint arXiv:2404.06806},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.06806},
    primaryClass={cs.IT eess.SP math.IT}
}