Cargando…

Group Sparse Precoding for Cloud-RAN with Multiple User Antennas

Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular networks. In a C-RAN, a massive number of low-cost remote antenna ports (RAPs) are connected to a single baseband unit (BBU) pool via high-speed low-late...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Zhiyang, Zhao, Yingxin, Wu, Hong, Ding, Shuxue
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7512638/
https://www.ncbi.nlm.nih.gov/pubmed/33265235
http://dx.doi.org/10.3390/e20020144
_version_ 1783586204406513664
author Liu, Zhiyang
Zhao, Yingxin
Wu, Hong
Ding, Shuxue
author_facet Liu, Zhiyang
Zhao, Yingxin
Wu, Hong
Ding, Shuxue
author_sort Liu, Zhiyang
collection PubMed
description Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular networks. In a C-RAN, a massive number of low-cost remote antenna ports (RAPs) are connected to a single baseband unit (BBU) pool via high-speed low-latency fronthaul links, which enables efficient resource allocation and interference management. As the RAPs are geographically distributed, group sparse beamforming schemes attract extensive studies, where a subset of RAPs is assigned to be active and a high spectral efficiency can be achieved. However, most studies assume that each user is equipped with a single antenna. How to design the group sparse precoder for the multiple antenna users remains little understood, as it requires the joint optimization of the mutual coupling transmit and receive beamformers. This paper formulates an optimal joint RAP selection and precoding design problem in a C-RAN with multiple antennas at each user. Specifically, we assume a fixed transmit power constraint for each RAP, and investigate the optimal tradeoff between the sum rate and the number of active RAPs. Motivated by the compressive sensing theory, this paper formulates the group sparse precoding problem by inducing the [Formula: see text]-norm as a penalty and then uses the reweighted [Formula: see text] heuristic to find a solution. By adopting the idea of block diagonalization precoding, the problem can be formulated as a convex optimization, and an efficient algorithm is proposed based on its Lagrangian dual. Simulation results verify that our proposed algorithm can achieve almost the same sum rate as that obtained from an exhaustive search.
format Online
Article
Text
id pubmed-7512638
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75126382020-11-09 Group Sparse Precoding for Cloud-RAN with Multiple User Antennas Liu, Zhiyang Zhao, Yingxin Wu, Hong Ding, Shuxue Entropy (Basel) Article Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular networks. In a C-RAN, a massive number of low-cost remote antenna ports (RAPs) are connected to a single baseband unit (BBU) pool via high-speed low-latency fronthaul links, which enables efficient resource allocation and interference management. As the RAPs are geographically distributed, group sparse beamforming schemes attract extensive studies, where a subset of RAPs is assigned to be active and a high spectral efficiency can be achieved. However, most studies assume that each user is equipped with a single antenna. How to design the group sparse precoder for the multiple antenna users remains little understood, as it requires the joint optimization of the mutual coupling transmit and receive beamformers. This paper formulates an optimal joint RAP selection and precoding design problem in a C-RAN with multiple antennas at each user. Specifically, we assume a fixed transmit power constraint for each RAP, and investigate the optimal tradeoff between the sum rate and the number of active RAPs. Motivated by the compressive sensing theory, this paper formulates the group sparse precoding problem by inducing the [Formula: see text]-norm as a penalty and then uses the reweighted [Formula: see text] heuristic to find a solution. By adopting the idea of block diagonalization precoding, the problem can be formulated as a convex optimization, and an efficient algorithm is proposed based on its Lagrangian dual. Simulation results verify that our proposed algorithm can achieve almost the same sum rate as that obtained from an exhaustive search. MDPI 2018-02-23 /pmc/articles/PMC7512638/ /pubmed/33265235 http://dx.doi.org/10.3390/e20020144 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Liu, Zhiyang
Zhao, Yingxin
Wu, Hong
Ding, Shuxue
Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title_full Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title_fullStr Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title_full_unstemmed Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title_short Group Sparse Precoding for Cloud-RAN with Multiple User Antennas
title_sort group sparse precoding for cloud-ran with multiple user antennas
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7512638/
https://www.ncbi.nlm.nih.gov/pubmed/33265235
http://dx.doi.org/10.3390/e20020144
work_keys_str_mv AT liuzhiyang groupsparseprecodingforcloudranwithmultipleuserantennas
AT zhaoyingxin groupsparseprecodingforcloudranwithmultipleuserantennas
AT wuhong groupsparseprecodingforcloudranwithmultipleuserantennas
AT dingshuxue groupsparseprecodingforcloudranwithmultipleuserantennas