Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels with Dynamic Filtering

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Shahmansoori, Arash
Format: Preprint
Published: 2019
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912091202387968
author Shahmansoori, Arash
author_facet Shahmansoori, Arash
contents Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multitask (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrificing of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_1911_07570
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels with Dynamic Filtering
Shahmansoori, Arash
Information Theory
Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multitask (MT)-sparse Bayesian learning (SBL) is applied for learning time-varying sparse channels in the uplink for multi-user massive MIMO orthogonal frequency division multiplexing systems. In particular, the dynamic information of the sparse channel is used to initialize the hyperparameters in the MT-SBL procedure for the next time step. Then, the expectation maximization based updates are applied to estimate the underlying parameters for different subcarriers. Through the simulation studies, it is observed that using the dynamic information from the previous time step considerably reduces the complexity and the required time for the convergence of MT-SBL algorithm with negligible sacrificing of the estimation accuracy. Finally, the power leakage is reduced due to considering angular refinement in the proposed algorithm.
title Sparse Bayesian Multi-Task Learning of Time-Varying Massive MIMO Channels with Dynamic Filtering
topic Information Theory
url https://arxiv.org/abs/1911.07570