File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이훈

Lee, Hoon
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 2343 -
dc.citation.number 3 -
dc.citation.startPage 2332 -
dc.citation.title IEEE SYSTEMS JOURNAL -
dc.citation.volume 13 -
dc.contributor.author Song, Changick -
dc.contributor.author Lee, Hoon -
dc.contributor.author Lee, Kyoung-Jae -
dc.date.accessioned 2023-12-21T18:40:19Z -
dc.date.available 2023-12-21T18:40:19Z -
dc.date.created 2023-09-06 -
dc.date.issued 2019-09 -
dc.description.abstract In this paper, we study a generalized framework that combines the three major techniques for 5G communication systems such as the multi-user multi-input multi-output (MuMIMO) techniques for spectral efficiency enhancement, the cognitive radio (CR) techniques for spectrum sharing, and the simultaneous wireless information and power transfer (SWIPT) techniques for convenient power supplies, which is called a MuMIMO-CR-SWIPT network. In this system, we have one base-station that simultaneously supports multiple information decoding (ID) and energy harvesting users under a condition that interference power to the primary ID (P-ID) receivers stays below a certain threshold. With this scenario, our goal is to design an optimal precoder that maximizes the sum-utility cost function for the ID users while satisfying the transmit power constraint at the BS, the energy requirement at each EH user, and the interference power constraint at each P-ID user. As we consider a general sum-utility cost function that puts together different target utilities in a general MuMIMO-CR-SWIPT environment, the previous works for each of the MuMIMO, CR, and SWIPT systems are carted as particular solutions of our framework. The problem has been considered to be challenging, since the weighted minimum mean-squared error problem transformation no longer resolves the non-convexity of the original problem. In this paper, we settle such an issue by demonstrating that the WMMSE transformation guarantees zero-duality gap between the primal and dual problems. Based on the observation, we attain the optimal precoder by solving the dual problem through the sub-gradient ellipsoid method. We also propose a simplified algorithm for the case of a single ID user, which is shown to achieve the globally optimum. Finally, we demonstrate the optimality and efficiency of the proposed algorithms through numerical simulation results. -
dc.identifier.bibliographicCitation IEEE SYSTEMS JOURNAL, v.13, no.3, pp.2332 - 2343 -
dc.identifier.doi 10.1109/JSYST.2018.2875762 -
dc.identifier.issn 1932-8184 -
dc.identifier.scopusid 2-s2.0-85055892807 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/65466 -
dc.identifier.url https://ieeexplore.ieee.org/document/8515224 -
dc.identifier.wosid 000482628500024 -
dc.language 영어 -
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC -
dc.title Optimal Precoder Designs for Sum-Utility Maximization in SWIPT-Enabled Multi-User MIMO Cognitive Radio Networks -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Information Systems; Engineering, Electrical & Electronic; Operations Research & Management Science; Telecommunications -
dc.relation.journalResearchArea Computer Science; Engineering; Operations Research & Management Science; Telecommunications -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Cognitive radio (CR) -
dc.subject.keywordAuthor multiuser (MIMO) -
dc.subject.keywordAuthor SWIPT -
dc.subject.keywordAuthor sum utility maximization -
dc.subject.keywordAuthor weighted MMSE -
dc.subject.keywordPlus SIMULTANEOUS WIRELESS INFORMATION -
dc.subject.keywordPlus RESOURCE-ALLOCATION -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.