The University of Southampton
University of Southampton Institutional Repository

Beyond MMSE: rank-1 subspace channel estimator for massive MIMO systems

Beyond MMSE: rank-1 subspace channel estimator for massive MIMO systems
Beyond MMSE: rank-1 subspace channel estimator for massive MIMO systems
To glean the benefits offered by massive multi-input multi-output (MIMO) systems, channel state information must be accurately acquired. Despite the high accuracy, the computational complexity of classical linear minimum mean squared error (MMSE) estimator becomes prohibitively high in the context of
massive MIMO, while the other low-complexity methods degrade the estimation accuracy seriously. In this paper, we develop a novel rank-1 subspace channel estimator to approximate the maximum likelihood (ML) estimator, which outperforms the linear MMSE estimator, but incurs a surprisingly low computational complexity. Our method first acquires the highly accurate angleof-arrival (AoA) information via a constructed space-embedding matrix and the rank-1 subspace method. Then, it adopts the post-reception beamforming to acquire the unbiased estimate of channel gains. Furthermore, a fast method is designed to implement our new estimator. Theoretical analysis shows that the extra gain achieved by our method over the linear MMSE estimator grows according to the rule of O(log10M), while its computational complexity is linearly scalable to the number of antennas M. Numerical simulations also validate the theoretical results. Our new method substantially extends the accuracycomplexity region and constitutes a promising channel estimation solution to the emerging massive MIMO communications.
Array signal processing, Channel estimation, Computational complexity, Cramer-Rao lower bound, Estimation, MMSE estimator, Massive MIMO, Matrix decomposition, Maximum likelihood estimation, channel estimation, low complexity, post-reception beamforming, rank-1 subspace
0090-6778
5896-5910
Li, Bin
65bafe93-0039-42cb-a160-6b10934c601a
Wei, Ziping
6b5263d0-de5f-49c5-8f90-faca20209549
Yang, Shaoshi
23650ec4-bcc8-4a2c-b1e7-a30893f52e52
Zhang, Yang
4cd76119-03ba-4df6-9b98-32d3b0c4dda6
Zhang, Jun
21cfdf0b-50de-459a-8efb-9f923155801e
Zhao, Chenglin
67c35ce2-7c55-4ca3-9ad6-2b5ee29c5439
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Li, Bin
65bafe93-0039-42cb-a160-6b10934c601a
Wei, Ziping
6b5263d0-de5f-49c5-8f90-faca20209549
Yang, Shaoshi
23650ec4-bcc8-4a2c-b1e7-a30893f52e52
Zhang, Yang
4cd76119-03ba-4df6-9b98-32d3b0c4dda6
Zhang, Jun
21cfdf0b-50de-459a-8efb-9f923155801e
Zhao, Chenglin
67c35ce2-7c55-4ca3-9ad6-2b5ee29c5439
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80

Li, Bin, Wei, Ziping, Yang, Shaoshi, Zhang, Yang, Zhang, Jun, Zhao, Chenglin and Chen, Sheng (2024) Beyond MMSE: rank-1 subspace channel estimator for massive MIMO systems. IEEE Transactions on Communications, 72 (9), 5896-5910. (doi:10.1109/TCOMM.2024.3392735).

Record type: Article

Abstract

To glean the benefits offered by massive multi-input multi-output (MIMO) systems, channel state information must be accurately acquired. Despite the high accuracy, the computational complexity of classical linear minimum mean squared error (MMSE) estimator becomes prohibitively high in the context of
massive MIMO, while the other low-complexity methods degrade the estimation accuracy seriously. In this paper, we develop a novel rank-1 subspace channel estimator to approximate the maximum likelihood (ML) estimator, which outperforms the linear MMSE estimator, but incurs a surprisingly low computational complexity. Our method first acquires the highly accurate angleof-arrival (AoA) information via a constructed space-embedding matrix and the rank-1 subspace method. Then, it adopts the post-reception beamforming to acquire the unbiased estimate of channel gains. Furthermore, a fast method is designed to implement our new estimator. Theoretical analysis shows that the extra gain achieved by our method over the linear MMSE estimator grows according to the rule of O(log10M), while its computational complexity is linearly scalable to the number of antennas M. Numerical simulations also validate the theoretical results. Our new method substantially extends the accuracycomplexity region and constitutes a promising channel estimation solution to the emerging massive MIMO communications.

Text
TCOM-SV-Beyond_MMSE_finnal - Accepted Manuscript
Download (1MB)
Text
TCOM2024-Sept - Version of Record
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 1 April 2024
e-pub ahead of print date: 23 April 2024
Published date: 18 September 2024
Additional Information: Publisher Copyright: IEEE
Keywords: Array signal processing, Channel estimation, Computational complexity, Cramer-Rao lower bound, Estimation, MMSE estimator, Massive MIMO, Matrix decomposition, Maximum likelihood estimation, channel estimation, low complexity, post-reception beamforming, rank-1 subspace

Identifiers

Local EPrints ID: 489475
URI: http://eprints.soton.ac.uk/id/eprint/489475
ISSN: 0090-6778
PURE UUID: 2c0c527c-0dce-4ac3-a579-3a4cd72de797

Catalogue record

Date deposited: 25 Apr 2024 16:31
Last modified: 20 Sep 2024 18:55

Export record

Altmetrics

Contributors

Author: Bin Li
Author: Ziping Wei
Author: Shaoshi Yang
Author: Yang Zhang
Author: Jun Zhang
Author: Chenglin Zhao
Author: Sheng Chen

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×