WEB OF SCIENCE
SCOPUS
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Minsu | - |
| dc.contributor.author | Park, Jeonghun | - |
| dc.contributor.author | Lee, Jemin | - |
| dc.date.accessioned | 2022-08-22T01:00:05Z | - |
| dc.date.available | 2022-08-22T01:00:05Z | - |
| dc.date.created | 2022-01-20 | - |
| dc.date.issued | 2022-07 | - |
| dc.identifier.issn | 1536-1276 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.11750/16813 | - |
| dc.description.abstract | In both academia and industry, multi-user multipleinput single-output (MU-MISO) techniques have shown enormous gains in spectral efficiency by exploiting spatial degrees of freedom. So far, an underlying assumption in most of the existing MU-MISO design has been that all the users use infinite blocklength, so that they can achieve the Shannon capacity. This setup, however, is not suitable considering delay-constrained users whose blocklength tends to be finite. In this paper, we consider a heterogeneous setting in MU-MISO systems where delay-constrained users and delay-tolerant users coexist, called a DCTU-MISO network. To maximize the sum spectral efficiency in this system, we present the spectral efficiency for delay-tolerant users and provide a lower bound of the spectral efficiency for delay-constrained users. We consider an optimization problem that maximizes the sum spectral efficiency of delay-tolerant users while satisfying the latency constraint of delay-constrained users, and propose a generalized power iteration (GPI) precoding algorithm that finds a principal precoding vector. Furthermore, we extend a DCTU-MISO network to the multiple time slots scenario and propose a recursive GPI precoding algorithm. In simulation results, we validate proposed methods outperform baseline schemes and present the effect of network parameters on the average sum spectral efficiency. IEEE | - |
| dc.language | English | - |
| dc.publisher | Institute of Electrical and Electronics Engineers | - |
| dc.title | Precoding Design for Multi-user MISO Systems with Delay-Constrained and -Tolerant Users | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1109/TWC.2021.3136872 | - |
| dc.identifier.wosid | 000838503800035 | - |
| dc.identifier.scopusid | 2-s2.0-85122576189 | - |
| dc.identifier.bibliographicCitation | IEEE Transactions on Wireless Communications, v.21, no.7, pp.5090 - 5105 | - |
| dc.description.isOpenAccess | FALSE | - |
| dc.subject.keywordAuthor | Array signal processing | - |
| dc.subject.keywordAuthor | spectral efficiency | - |
| dc.subject.keywordAuthor | Ultra reliable low latency communication | - |
| dc.subject.keywordAuthor | ultra-reliable low-latency communication | - |
| dc.subject.keywordAuthor | Downlink | - |
| dc.subject.keywordAuthor | finite blocklength | - |
| dc.subject.keywordAuthor | incremental redundancy hybrid automatic repeat request | - |
| dc.subject.keywordAuthor | MIMO communication | - |
| dc.subject.keywordAuthor | Multi-user multiple-input multiple-output | - |
| dc.subject.keywordAuthor | Optimization | - |
| dc.subject.keywordAuthor | Precoding | - |
| dc.subject.keywordAuthor | Resource management | - |
| dc.subject.keywordPlus | SHORT BLOCKLENGTH REGIME | - |
| dc.subject.keywordPlus | RESOURCE-ALLOCATION | - |
| dc.subject.keywordPlus | MIMO | - |
| dc.subject.keywordPlus | DOWNLINK | - |
| dc.subject.keywordPlus | POWER ALLOCATION | - |
| dc.subject.keywordPlus | PERFORMANCE | - |
| dc.subject.keywordPlus | THROUGHPUT | - |
| dc.subject.keywordPlus | SELECTION | - |
| dc.citation.endPage | 5105 | - |
| dc.citation.number | 7 | - |
| dc.citation.startPage | 5090 | - |
| dc.citation.title | IEEE Transactions on Wireless Communications | - |
| dc.citation.volume | 21 | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Engineering; Telecommunications | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic; Telecommunications | - |
| dc.type.docType | Article | - |