Low-rank matrix completion via Riemannian pursuit for topological interference management

Yuanming Shi, Jun Zhang, Khaled Letaief

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

This paper considers the topological interference management problem in a partially connected K-user interference channel, where no channel state information at transmitters (CSIT) is available beyond the network topology knowledge. Due to the practical CSI assumption, this problem has recently received enough attention. In particular, it has been established that the topological interference management problem, in terms of degrees of freedom (DoF), is equivalent to the index coding problem with linear schemes. However, so far only a few index coding problems have been solved, and thus there is a lack of a systematic way to characterize optimal DoF of an arbitrary network topology. In this paper, we present a low-rank matrix completion (LRMC) approach to find linear solutions to maximize the achievable symmetric DoF for any given network topology. To decode the desired messages at each receiver, we also propose an LRMC based channel acquisition scheme, which can obtain interference-free measurements of the desired channel at each receiver while minimizing the pilot training length. To address the NP-hardness of the non-convex rank objective function in the resulting LRMC problem, we further present a Riemannian pursuit (RP) algorithm to solve it efficiently. This algorithm alternatively performs fixed-rank optimization using Riemannian optimization and rank increase by exploiting the manifold structure of the fixed-rank matrices. The LRMC approach aided by the RP algorithms not only recovers the existing optimal DoF results but also provides insights for general network topologies.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1831-1835
Number of pages5
Volume2015-June
ISBN (Electronic)9781467377041
DOIs
Publication statusPublished - 28 Sep 2015
Externally publishedYes
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: 14 Jun 201519 Jun 2015

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period14/6/1519/6/15

Fingerprint

Matrix Completion
Low-rank Matrices
Pursuit
Network Topology
Interference
Degree of freedom
Topology
Receiver
Coding
Matrix Completion Problem
Interference Channel
NP-hardness
Optimization
Decode
Channel state information
Channel State Information
Transmitter
Transmitters
Objective function
Maximise

Keywords

  • degrees of freedom (DoF)
  • Interference alignment
  • low-rank matrix completion
  • Riemannian optimization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Shi, Y., Zhang, J., & Letaief, K. (2015). Low-rank matrix completion via Riemannian pursuit for topological interference management. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (Vol. 2015-June, pp. 1831-1835). [7282772] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282772

Low-rank matrix completion via Riemannian pursuit for topological interference management. / Shi, Yuanming; Zhang, Jun; Letaief, Khaled.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 1831-1835 7282772.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shi, Y, Zhang, J & Letaief, K 2015, Low-rank matrix completion via Riemannian pursuit for topological interference management. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. vol. 2015-June, 7282772, Institute of Electrical and Electronics Engineers Inc., pp. 1831-1835, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 14/6/15. https://doi.org/10.1109/ISIT.2015.7282772
Shi Y, Zhang J, Letaief K. Low-rank matrix completion via Riemannian pursuit for topological interference management. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June. Institute of Electrical and Electronics Engineers Inc. 2015. p. 1831-1835. 7282772 https://doi.org/10.1109/ISIT.2015.7282772
Shi, Yuanming ; Zhang, Jun ; Letaief, Khaled. / Low-rank matrix completion via Riemannian pursuit for topological interference management. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. pp. 1831-1835
@inproceedings{b4d36645b5284149bea2313c285f6f6a,
title = "Low-rank matrix completion via Riemannian pursuit for topological interference management",
abstract = "This paper considers the topological interference management problem in a partially connected K-user interference channel, where no channel state information at transmitters (CSIT) is available beyond the network topology knowledge. Due to the practical CSI assumption, this problem has recently received enough attention. In particular, it has been established that the topological interference management problem, in terms of degrees of freedom (DoF), is equivalent to the index coding problem with linear schemes. However, so far only a few index coding problems have been solved, and thus there is a lack of a systematic way to characterize optimal DoF of an arbitrary network topology. In this paper, we present a low-rank matrix completion (LRMC) approach to find linear solutions to maximize the achievable symmetric DoF for any given network topology. To decode the desired messages at each receiver, we also propose an LRMC based channel acquisition scheme, which can obtain interference-free measurements of the desired channel at each receiver while minimizing the pilot training length. To address the NP-hardness of the non-convex rank objective function in the resulting LRMC problem, we further present a Riemannian pursuit (RP) algorithm to solve it efficiently. This algorithm alternatively performs fixed-rank optimization using Riemannian optimization and rank increase by exploiting the manifold structure of the fixed-rank matrices. The LRMC approach aided by the RP algorithms not only recovers the existing optimal DoF results but also provides insights for general network topologies.",
keywords = "degrees of freedom (DoF), Interference alignment, low-rank matrix completion, Riemannian optimization",
author = "Yuanming Shi and Jun Zhang and Khaled Letaief",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7282772",
language = "English",
volume = "2015-June",
pages = "1831--1835",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Low-rank matrix completion via Riemannian pursuit for topological interference management

AU - Shi, Yuanming

AU - Zhang, Jun

AU - Letaief, Khaled

PY - 2015/9/28

Y1 - 2015/9/28

N2 - This paper considers the topological interference management problem in a partially connected K-user interference channel, where no channel state information at transmitters (CSIT) is available beyond the network topology knowledge. Due to the practical CSI assumption, this problem has recently received enough attention. In particular, it has been established that the topological interference management problem, in terms of degrees of freedom (DoF), is equivalent to the index coding problem with linear schemes. However, so far only a few index coding problems have been solved, and thus there is a lack of a systematic way to characterize optimal DoF of an arbitrary network topology. In this paper, we present a low-rank matrix completion (LRMC) approach to find linear solutions to maximize the achievable symmetric DoF for any given network topology. To decode the desired messages at each receiver, we also propose an LRMC based channel acquisition scheme, which can obtain interference-free measurements of the desired channel at each receiver while minimizing the pilot training length. To address the NP-hardness of the non-convex rank objective function in the resulting LRMC problem, we further present a Riemannian pursuit (RP) algorithm to solve it efficiently. This algorithm alternatively performs fixed-rank optimization using Riemannian optimization and rank increase by exploiting the manifold structure of the fixed-rank matrices. The LRMC approach aided by the RP algorithms not only recovers the existing optimal DoF results but also provides insights for general network topologies.

AB - This paper considers the topological interference management problem in a partially connected K-user interference channel, where no channel state information at transmitters (CSIT) is available beyond the network topology knowledge. Due to the practical CSI assumption, this problem has recently received enough attention. In particular, it has been established that the topological interference management problem, in terms of degrees of freedom (DoF), is equivalent to the index coding problem with linear schemes. However, so far only a few index coding problems have been solved, and thus there is a lack of a systematic way to characterize optimal DoF of an arbitrary network topology. In this paper, we present a low-rank matrix completion (LRMC) approach to find linear solutions to maximize the achievable symmetric DoF for any given network topology. To decode the desired messages at each receiver, we also propose an LRMC based channel acquisition scheme, which can obtain interference-free measurements of the desired channel at each receiver while minimizing the pilot training length. To address the NP-hardness of the non-convex rank objective function in the resulting LRMC problem, we further present a Riemannian pursuit (RP) algorithm to solve it efficiently. This algorithm alternatively performs fixed-rank optimization using Riemannian optimization and rank increase by exploiting the manifold structure of the fixed-rank matrices. The LRMC approach aided by the RP algorithms not only recovers the existing optimal DoF results but also provides insights for general network topologies.

KW - degrees of freedom (DoF)

KW - Interference alignment

KW - low-rank matrix completion

KW - Riemannian optimization

UR - http://www.scopus.com/inward/record.url?scp=84969784607&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969784607&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282772

DO - 10.1109/ISIT.2015.7282772

M3 - Conference contribution

AN - SCOPUS:84969784607

VL - 2015-June

SP - 1831

EP - 1835

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -