DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Choi, Junil | - |
dc.contributor.advisor | 최준일 | - |
dc.contributor.author | Cho, Hyesang | - |
dc.date.accessioned | 2022-04-27T19:31:45Z | - |
dc.date.available | 2022-04-27T19:31:45Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=948982&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/296077 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2021.2,[ii, 19 p. :] | - |
dc.description.abstract | Intelligent reflecting surface (IRS) has become a promising technology to aid next generation wireless communication systems. In this paper, we develop an alternating beamforming technique with a novel concept of IRS element allocation for multiple-input multiple-output systems when a base station supports multiple single antenna users aided with a single IRS. Specifically, we allocate each IRS element separately to each user, thus, in the beamforming stage allowing the IRS element only consider a single user at a time. In result to this separation, the complexity is vastly decreased. The proposed beamforming technique tries to maximize the minimum rate or sum rate of all users with minimal complexity. In the numerical results, we show that the proposed technique is comparable to the convex optimization-based benchmark with sufficiently less complexity. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | IRS element allocation▼aalternating beamforming▼aminimum rate maximization▼asum rate maximization▼alow complexity beamforming | - |
dc.subject | 지능형 반사 표면 소자 할당▼a교대 빔포밍▼a최소 정보 전달율 최대화▼a합산 정보 전달율 최대화▼a저복잡도 빔포밍 | - |
dc.title | Alternating beamforming with intelligent reflecting surface element allocation | - |
dc.title.alternative | 지능형 반사 표면의 소자 할당을 이용한 교대 빔포밍 기법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 조혜상 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.