Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 45 of the 46 references it cites were found in a registry or an index.

Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

Open access
Shi, Yuanming, Zhang, Jun, Letaief, Khaled B. · 2016 · IEEE Transactions on Wireless Communications

Abstract

In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected $K$-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed-rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs f…

Overview

Integrity signals

Registry

Crossref · 10.1109/twc.2016.2544758

Cites

45 of 45 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 2

  1. hassibi, 0, Topological interference alignment in wireless networks, Proc Int Workshop Smart Antennas, 1
  2. jain, 0, Proc ACM Symp Theory Comput, 665

Cited by

See all 56

Metadata

Authors
Shi, Y., Zhang, J., & Letaief, K. B.
Affiliations
  • ShanghaiTech University (CN)
  • Hong Kong University of Science and Technology (HK)
Venue
IEEE Transactions on Wireless Communications
Published
2016
Pages
1-1
ISSN
1536-1276 (ISSN-L)
OpenAlex
W2310614892
Cited by
56
References
46
Citations by year
2025: 1 · 2024: 2 · 2023: 5 · 2022: 8 · 2021: 7 · 2020: 3 · 2019: 11 · 2018: 12 · 2017: 2 · 2016: 5
FWCI
8.65
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Wireless Communications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cooperative Communication and Network Coding
Keywords
topological interference management, low-rank matrix completion, Riemannian optimization, degrees of freedom, interference channel, partially connected networks, index coding

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.