Learning the MMSE Channel Estimator

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors David Neumann, Thomas Wiese, W. Utschick
Journal/Conference Name IEEE Transactions on Signal Processing
Paper Category
Paper Abstract We present a method for estimating conditionally Gaussian random vectors with random covariance matrices, which uses techniques from the field of machine learning. Such models are typical in communication systems, where the covariance matrix of the channel vector depends on random parameters, e.g., angles of propagation paths. If the covariance matrices exhibit certain Toeplitz and shift-invariance structures, the complexity of the minimum mean squared error (MMSE) channel estimator can be reduced to <inline-formula><tex-math notation="LaTeX">${\mathcal O}(M\log M)$ </tex-math></inline-formula> floating point operations, where <inline-formula><tex-math notation="LaTeX">$M$</tex-math> </inline-formula> is the channel dimension. While in the absence of structure the complexity is much higher, we obtain a similarly efficient (but suboptimal) estimator by using the MMSE estimator of the structured model as a blueprint for the architecture of a neural network. This network learns the MMSE estimator for the unstructured model, but only within the given class of estimators that contains the MMSE estimator for the structured model. Numerical simulations with typical spatial channel models demonstrate the generalization properties of the chosen class of estimators to realistic channel models.
Date of publication 2018
Code Programming Language Julia
Comment

Copyright Researcher 2021