kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Feasible Point Pursuit and Successive Convex Approximation for Transmit Power Minimization in SWIPT-Multigroup Multicasting Systems
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg.ORCID iD: 0000-0003-2298-6774
2021 (English)In: IEEE Transactions on Green Communications and Networking, ISSN 24732400, Vol. 5, no 2, p. 884-894Article in journal (Refereed) Published
Abstract [en]

We consider three wireless multi-group (MG) multicasting (MC) systems capable of handling heterogeneous user types viz., information decoding (ID) specific users with conventional receiver architectures, energy harvesting (EH) only users with non-linear EH module, and users with joint ID and EH capabilities having separate units for the two operations, respectively. Each user is categorized under unique group(s), which can be of MC type specifically meant for ID users, and/or an energy group consisting of EH explicit users. The joint ID and EH users are a part of both EH group and single MC group. We formulate an optimization problem to minimize the total transmit power with optimal precoder designs for the three aforementioned scenarios, under certain quality-of-service constraints. The problem may be adapted to the well-known semi-definite program and solved via relaxation of rank-1 constraint. However, this process leads to performance degradation in some cases, which increases with the rank of solution obtained from the relaxed problem. Hence, we develop a novel technique motivated by the feasible-point pursuit successive convex approximation method in order to address the rank-related issue. The benefits of proposed method are illustrated under various operating conditions and parameter values, with comparison between the three above-mentioned scenarios.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2021. Vol. 5, no 2, p. 884-894
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-294986DOI: 10.1109/TGCN.2021.3050736ISI: 000655126900028Scopus ID: 2-s2.0-85099580160OAI: oai:DiVA.org:kth-294986DiVA, id: diva2:1555335
Note

QC 20250401

Available from: 2021-05-18 Created: 2021-05-18 Last updated: 2025-04-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Ottersten, Björn

Search in DiVA

By author/editor
Ottersten, Björn
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf