University of Oulu

G. Venkatraman, A. Tölli, J. Kaleva and M. Juntti, "JP-CoMP with antenna selection for multi-carrier C-RAN with finite backhaul capacity," 2017 IEEE International Conference on Communications (ICC), Paris, 2017, pp. 1-7. doi: 10.1109/ICC.2017.7996948

JP-CoMP with antenna selection for multi-carrier C-RAN with finite backhaul capacity

Saved in:
Author: Venkatraman, Ganesh1; Tölli, Antti1; Kaleva, Jarkko1;
Organizations: 1Centre for Wireless Communications (CWC) - Radio Technologies, University of Oulu, Finland - FI-90014, P.O. Box 4500
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.2 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2017
Publish Date: 2018-08-06


We consider a multi-carrier joint processing (JP) coordinated multi-point (CoMP) cellular system wherein the beamformers are designed by a centralized controller (CC). Those are subsequently fed back to the respective base stations (BSs) via finite capacity backhaul link. Hence, we design transmit beamformers at the CC that associate users to BSs depending on their backhaul capacity and users channel state to address this problem. Upon identifying the active links, user multiplexing and scheduling over spatial and frequency dimensions are performed in conjunction with the beamformer design for all BSs subject to the objective of minimizing the number of backlogged packets at the CC. Since the beamformers are notified to the respective BSs along with the data, the backhaul utilization must include the overhead incurred by the quantized beamformers, which has higher precision as it is used by all data symbols transmitted over a coherence block. In this paper, we assume fixed quantization levels for each complex entry in the beamformers. Therefore, we select a subset of entries for each beamformer to reduce the overhead incurred by the active antennas, which when removed has the minimal impact on the user rate. With the above mentioned constraints and requirements, the beamformer design becomes a nonconvex combinatorial problem. Therefore, we provide a solution for the proposed formulation by employing successive convex approximation technique to handle the nonconvexity and the combinatorial search involving binary variables are replaced by a linear bounds along with a sparsity inducing term in the objective. The proposed method is useful only when the backhaul usage due to the beamformers is significantly larger when compared to the overhead incurred by the active users data. Numerical results are provided to illustrate the performance.

see all

Series: IEEE International Conference on Communications
ISSN: 1550-3607
ISSN-E: 1938-1883
ISSN-L: 1550-3607
ISBN: 978-1-4673-8999-0
ISBN Print: 978-1-4673-9000-2
Pages: 1 - 7
DOI: 10.1109/ICC.2017.7996948
Host publication: 2017 IEEE International Conference on Communications (ICC)
Conference: IEEE International Conference on Communications
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Copyright information: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.