Message-Passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission

Sang Hyun Lee; Illsoo Sohn

doi:10.1109/LCOMM.2015.2461158

Message-Passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission

Sang Hyun Lee
, Illsoo Sohn

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

Abstract

This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite b-matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.

Original language	English
Article number	7167660
Pages (from-to)	1850-1853
Number of pages	4
Journal	IEEE Communications Letters
Volume	19
Issue number	10
DOIs	https://doi.org/10.1109/LCOMM.2015.2461158
Publication status	Published - 2015 Oct 1
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 1997-2012 IEEE.

Keywords

Affinity propagation
MIMO
cooperative communication
message passing algorithm

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2015.2461158

Cite this

@article{9e8b6e059c4142dc81edab417613001b,

title = "Message-Passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission",

abstract = "This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite b-matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.",

keywords = "Affinity propagation, MIMO, cooperative communication, message passing algorithm",

author = "Lee, \{Sang Hyun\} and Illsoo Sohn",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2015",

month = oct,

day = "1",

doi = "10.1109/LCOMM.2015.2461158",

language = "English",

volume = "19",

pages = "1850--1853",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Message-Passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission

AU - Lee, Sang Hyun

AU - Sohn, Illsoo

PY - 2015/10/1

Y1 - 2015/10/1

N2 - This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite b-matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.

AB - This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite b-matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.

KW - Affinity propagation

KW - MIMO

KW - cooperative communication

KW - message passing algorithm

UR - https://www.scopus.com/pages/publications/84944262572

U2 - 10.1109/LCOMM.2015.2461158

DO - 10.1109/LCOMM.2015.2461158

M3 - Article

AN - SCOPUS:84944262572

SN - 1089-7798

VL - 19

SP - 1850

EP - 1853

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 10

M1 - 7167660

ER -

Message-Passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this