Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/181807
Title: | Hybrid near- and far-field THz UM-MIMO channel estimation: a sparsifying matrix learning-aided Bayesian approach | Authors: | Li, Yuanjian Madhukumar, A. S. |
Keywords: | Engineering | Issue Date: | 2024 | Source: | Li, Y. & Madhukumar, A. S. (2024). Hybrid near- and far-field THz UM-MIMO channel estimation: a sparsifying matrix learning-aided Bayesian approach. IEEE Transactions On Wireless Communications. https://dx.doi.org/10.1109/TWC.2024.3514141 | Project: | FCP-NTU-RG-2022-014 NRF-CRP23-2019-0005 |
Journal: | IEEE Transactions on Wireless Communications | Abstract: | Channel estimation (CE) is a critical challenge in harnessing the potential of Terahertz (THz) ultra-massive multiple-input multiple-output (UM-MIMO) systems. Sparsity-exploiting compressed sensing (CS)-aided CE (CSCE) can enhance THz UM-MIMO CE performance with affordable pilot overhead. However, the near-field propagation region becomes significant in THz UM-MIMO networks due to the large array aperture and high carrier frequency, leading to a more profound coexistence of near- and far-field radiation patterns. This hybrid-field propagation characteristic renders existing CSCE frameworks ineffective due to the lack of an appropriate sparsifying matrix. In this work, we investigate the uplink THz UM-MIMO CE problem, by developing a practical THz UM-MIMO channel model that incorporates near- and far-field paths, molecular absorption, and reflection attenuation. We propose a dictionary learning (DL)-aided Bayesian THz CSCE solution to achieve accurate, robust and pilot-efficient CE, even in ill-posed scenarios. Specifically, we tailor a batch-delayed online DL (BD-ODL) algorithm to generate an appropriate dictionary for the hybrid-field THz UM-MIMO channel model. Furthermore, we propose a Bayesian learning (BL)-enabled CSCE framework to leverage THz sparsity and utilize the learnt dictionary. To establish a lower bound for the mean squared error (MSE), we derive the Bayesian Cramér-Rao bound (BCRB). We also conduct a complexity analysis to quantify the required computational resources. Numerical results show a significant improvement in normalized MSE (NMSE) performance compared to conventional CE and CSCE baselines, and demonstrate rapid convergence. | URI: | https://hdl.handle.net/10356/181807 | ISSN: | 1536-1276 | DOI: | 10.1109/TWC.2024.3514141 | DOI (Related Dataset): | 10.21979/N9/HOX79X | Schools: | College of Computing and Data Science | Rights: | © 2024 IEEE. All rights reserved. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | CCDS Journal Articles |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.