Precoder Design for Physical Layer Multicasting

This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Zhu, Hao, Prasad, Narayan, Rangarajan, Sampath
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 05.04.2012
Subjects:
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered by linear precoding schemes, we consider the design of linear precoders using the aforementioned two criteria. We first consider the scenario wherein the linear precoder can be any complex-valued matrix subject to rank and power constraints. We propose cyclic alternating ascent based precoder design algorithms and establish their convergence to respective stationary points. Simulation results reveal that our proposed algorithms considerably outperform known competing solutions. We then consider a scenario in which the linear precoder can be formed by selecting and concatenating precoders from a given finite codebook of precoding matrices, subject to rank and power constraints. We show that under this scenario, the instantaneous rate maximization problem is equivalent to a robust submodular maximization problem which is strongly NP hard. We propose a deterministic approximation algorithm and show that it yields a bicriteria approximation. For the weighted sum delay minimization problem we propose a simple deterministic greedy algorithm, which at each step entails approximately maximizing a submodular set function subject to multiple knapsack constraints, and establish its performance guarantee.
AbstractList This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered by linear precoding schemes, we consider the design of linear precoders using the aforementioned two criteria. We first consider the scenario wherein the linear precoder can be any complex-valued matrix subject to rank and power constraints. We propose cyclic alternating ascent based precoder design algorithms and establish their convergence to respective stationary points. Simulation results reveal that our proposed algorithms considerably outperform known competing solutions. We then consider a scenario in which the linear precoder can be formed by selecting and concatenating precoders from a given finite codebook of precoding matrices, subject to rank and power constraints. We show that under this scenario, the instantaneous rate maximization problem is equivalent to a robust submodular maximization problem which is strongly NP hard. We propose a deterministic approximation algorithm and show that it yields a bicriteria approximation. For the weighted sum delay minimization problem we propose a simple deterministic greedy algorithm, which at each step entails approximately maximizing a submodular set function subject to multiple knapsack constraints, and establish its performance guarantee.
Author Rangarajan, Sampath
Prasad, Narayan
Zhu, Hao
Author_xml – sequence: 1
  givenname: Hao
  surname: Zhu
  fullname: Zhu, Hao
– sequence: 2
  givenname: Narayan
  surname: Prasad
  fullname: Prasad, Narayan
– sequence: 3
  givenname: Sampath
  surname: Rangarajan
  fullname: Rangarajan, Sampath
BookMark eNotjUFLwzAYhoMoOOfuHgue2335kjRfjjJ1ChV32H2kSTo7SqtJK-7fW9DTy8MDz3vDLvuhD4zdcSgkKQVrG3_a74JzMEWJpblgCxSC5yQRr9kqpRMAYKlRKbFg610MbvAhZo8htcc-a4aY7T7OqXW2yyp7ns3b1I0zprHtj7fsqrFdCqv_XbL989N-85JX79vXzUOVW8VV7m2NYITTTmgi7aFpDHALnppARjpbc0POkgCkgB5qV6pAWpJF7aQEsWT3f9nPOHxNIY2H0zDFfn48IBCiUFgq8Qsx4kW6
ContentType Paper
Copyright 2012. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2012. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.1109.6269
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: ProQuest Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a515-dab2093c7c37887d0ff901a0d8fe894cab198ca83028e2d0bc65e8748a27c4403
IEDL.DBID M7S
IngestDate Mon Jun 30 09:49:26 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a515-dab2093c7c37887d0ff901a0d8fe894cab198ca83028e2d0bc65e8748a27c4403
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2082235265?pq-origsite=%requestingapplication%
PQID 2082235265
PQPubID 2050157
ParticipantIDs proquest_journals_2082235265
PublicationCentury 2000
PublicationDate 20120405
PublicationDateYYYYMMDD 2012-04-05
PublicationDate_xml – month: 04
  year: 2012
  text: 20120405
  day: 05
PublicationDecade 2010
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2012
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.4812579
SecondaryResourceType preprint
Snippet This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Approximation
Ascent
Computer simulation
Delay
Greedy algorithms
Mathematical analysis
Matrix methods
Maximization
Multicasting
Optimization
Production scheduling
Title Precoder Design for Physical Layer Multicasting
URI https://www.proquest.com/docview/2082235265
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60VfDkGx-17MFr7D6y3eQkqC0KtQQtUk9ldpKFXtq6W4s_3yRu9SB48RhyyTDJzJfJl28ALo2grts4TEfIGTcmYVLyjPG4KDDReaR9r8OXQTYcivFYqrrgVtW0ynVM9IFaz8nVyO0l3aYyL-Z-vXhjrmuUe12tW2hsQtOpJESeuvf8XWOJu5lFzMnX66SX7upg-TFdeZnNKwvl5a8I7NNKf_e_C9qDpsKFKfdhw8wOYNvTOak6hI5yF11tyuDOMzQCC00DVbskGKDF2YH_ektYOd7zEYz6vdHtPatbIzC0AIRpzONQJpSRk4PPdFgUNq9jqEVhhOSEeSQFodP2EibWYU7d1IiMC4wz4jxMjqExm8_MCQSa21MbWo_kxoIpTAVRSKRFkhAZRHkKrbX5k3p7V5Mf28_-nj6HHYswYk91SVvQWJbv5gK2aLWcVmUbmje9oXpqe6_ZkXp4VK-fJZuiFg
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V09T8MwED2VFgQT3-KjQAYYA6njNs6AGChVq4YqEhXqVjlnR-rSlqQU-FH8R85uAwMSWwfmSFFiP9-9Zz_fAVxqgQ0DHFfVJHe51r4bhjxwOUtT6aukpmyvw-co6PXEYBDGJfgs7sIYW2URE22gVhM0e-Qk0imV2WLud9MX13SNMqerRQuNBSy6-uONJFt-22nS_F4x1nro37fdZVcBV1LudpVMGKl4DNBUUg-Ul6aUEqWnRKpFyFEmJMNRmrJYQjPlJdioaxFwIVmAnHs-vXYNKsQiWGidgk_fWzqsERBB9xeHobZS2I3M3kdzW9XzmpRD-Cvg2yzW2v5n_78DlVhOdbYLJT3egw1rVsV8H25iI-OVzpym9Z84RLydeAk4J5KkIhx7sRhlblzdB9BfxSceQnk8GesjcBSnmOQR3hJNVFHWBaKHqITvI2opw2OoFqM9XC7efPgz1Cd_P76AzXb_MRpGnV73FLaISzFr6qlXoTzLXvUZrON8NsqzcwsUB4Yrnpgvfl36Fw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Precoder+Design+for+Physical+Layer+Multicasting&rft.jtitle=arXiv.org&rft.au=Zhu%2C+Hao&rft.au=Prasad%2C+Narayan&rft.au=Rangarajan%2C+Sampath&rft.date=2012-04-05&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1109.6269