Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1910.10967v1 (cs)
[Submitted on 24 Oct 2019]

Title:Joint User Selection and Precoding in Multiuser MIMO Systems via Group LASSO

Authors:Saba Asaad, Ali Bereyhi, Ralf R. Muller, Rafael F. Schaefer
View PDF
Abstract:Joint user selection and precoding in multiuser MIMO settings can be interpreted as group sparse recovery in linear models. In this problem, a signal with group sparsity is to be reconstructed from an underdetermined system of equations. This paper utilizes this equivalent interpretation and develops a computationally tractable algorithm based on the method of group LASSO. Compared to the state of the art, the proposed scheme shows performance enhancements in two different respects: higher achievable sum-rate and lower interference at the non-selected user terminals.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1910.10967 [cs.IT]
  (or arXiv:1910.10967v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1910.10967

Submission history

From: Saba Asaad [view email]
[v1] Thu, 24 Oct 2019 08:08:37 UTC (101 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2019-10
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Saba Asaad
Ali Bereyhi
Ralf R. Müller
Rafael F. Schaefer
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)