The University of Southampton
University of Southampton Institutional Repository

A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint

A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint
A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint
Coordinated scheduling/beamforming (CS/CB) substantially mitigates the intercell interference (ICI), hence increasing the cell-edge throughput on the downlink (DL) of coordinated multipoint (CoMP) systems. To maximize the DL throughput, the cooperating base stations (BSs) jointly select the best set of users for DL scheduling and then jointly design a set of beamforming (BF) vectors to approach the throughput limit. However, finding the optimal BF vectors requires an exhaustive search and substantial channel state information (CSI) feedback, hence resulting in high algorithmic complexity and heavy uplink traffic load. Hence, we conceive a new cross-layer algorithm to achieve high performance at a lower feedback amount and at lower algorithmic complexity. Based on the fact that different BSs usually have different traffic loads, we divide the BSs into two different types, i.e., the master BSs (MBSs) and the slave BSs (SBSs), where MBSs have a higher transmission priority than SBSs. The scheduling relies on an interference threshold, whereas our robust BF scheme exploits both the channel direction information (CDI), which is quantized using the technique of limited feedback, and the channel quality information (CQI), which is assumed to be fed back accurately. Our numerical results show that the proposed algorithm does not lose much performance compared with that achieved by an exhaustive search, whereas the algorithmic complexity is as low as that of the solutions operating without CoMP.
0018-9545
Yang, Yingxiang
358390ba-6949-4b14-9798-52510510ab06
Bai, Bo
0bcaf350-5f18-4c59-a28e-4f6688fe725e
Chen, Wei
43d5a7bc-ca02-4943-881e-56f901b5f533
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Yang, Yingxiang
358390ba-6949-4b14-9798-52510510ab06
Bai, Bo
0bcaf350-5f18-4c59-a28e-4f6688fe725e
Chen, Wei
43d5a7bc-ca02-4943-881e-56f901b5f533
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Yang, Yingxiang, Bai, Bo, Chen, Wei and Hanzo, Lajos (2013) A Low-Complexity Cross-Layer Algorithm for Coordinated Downlink Scheduling and Robust Beamforming Under a Limited Feedback Constraint. IEEE Transactions on Vehicular Technology. (In Press)

Record type: Article

Abstract

Coordinated scheduling/beamforming (CS/CB) substantially mitigates the intercell interference (ICI), hence increasing the cell-edge throughput on the downlink (DL) of coordinated multipoint (CoMP) systems. To maximize the DL throughput, the cooperating base stations (BSs) jointly select the best set of users for DL scheduling and then jointly design a set of beamforming (BF) vectors to approach the throughput limit. However, finding the optimal BF vectors requires an exhaustive search and substantial channel state information (CSI) feedback, hence resulting in high algorithmic complexity and heavy uplink traffic load. Hence, we conceive a new cross-layer algorithm to achieve high performance at a lower feedback amount and at lower algorithmic complexity. Based on the fact that different BSs usually have different traffic loads, we divide the BSs into two different types, i.e., the master BSs (MBSs) and the slave BSs (SBSs), where MBSs have a higher transmission priority than SBSs. The scheduling relies on an interference threshold, whereas our robust BF scheme exploits both the channel direction information (CDI), which is quantized using the technique of limited feedback, and the channel quality information (CQI), which is assumed to be fed back accurately. Our numerical results show that the proposed algorithm does not lose much performance compared with that achieved by an exhaustive search, whereas the algorithmic complexity is as low as that of the solutions operating without CoMP.

Text
tvt-hanzo-2271876-proof.pdf - Other
Download (2MB)

More information

Accepted/In Press date: 2013
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 354860
URI: http://eprints.soton.ac.uk/id/eprint/354860
ISSN: 0018-9545
PURE UUID: eb920156-8d8d-4ff9-a9f8-fbd0a54e73f0
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 21 Jul 2013 08:17
Last modified: 15 Mar 2024 02:38

Export record

Contributors

Author: Yingxiang Yang
Author: Bo Bai
Author: Wei Chen
Author: Lajos Hanzo ORCID iD

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.

×