DC Field | Value | Language |
---|---|---|
dc.contributor.author | 권선형 | ko |
dc.contributor.author | 이후진 | ko |
dc.contributor.author | 강준혁 | ko |
dc.date.accessioned | 2013-03-12T13:29:30Z | - |
dc.date.available | 2013-03-12T13:29:30Z | - |
dc.date.created | 2013-01-08 | - |
dc.date.created | 2013-01-08 | - |
dc.date.issued | 2012-05 | - |
dc.identifier.citation | 한국정보기술학회논문지, v.10, no.5, pp.73 - 79 | - |
dc.identifier.issn | 1598-8619 | - |
dc.identifier.uri | http://hdl.handle.net/10203/102469 | - |
dc.description.abstract | In this paper, we propose an adaptive Best-M feedback algorithm designed to reduce the feedback burden especially for orthogonal frequency division multiple access (OFDMA) systems with multi-user multiple-input multiple-output (MU-MIMO) precoding. The key idea of the proposed algorithm is to adaptively control the amount of the feedback information under the consideration of both the channel state information (CSI) and the system objective function and thus to ultimately reduce the feedback burden of all users. Various computer simulation results demonstrate that the feedback burden for users is significantly reduced, while the system throughput performance is being maintained as the conventional Best-M algorithm. | - |
dc.language | English | - |
dc.publisher | 한국정보기술학회 | - |
dc.title | Adaptive Best-M Feedback Algorithm for MU-MIMO Systems | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.issue | 5 | - |
dc.citation.beginningpage | 73 | - |
dc.citation.endingpage | 79 | - |
dc.citation.publicationname | 한국정보기술학회논문지 | - |
dc.identifier.kciid | ART001662366 | - |
dc.contributor.localauthor | 강준혁 | - |
dc.contributor.nonIdAuthor | 권선형 | - |
dc.contributor.nonIdAuthor | 이후진 | - |
dc.subject.keywordAuthor | multi-user | - |
dc.subject.keywordAuthor | multiple-input multiple-output (MIMO) | - |
dc.subject.keywordAuthor | channel state information (CSI) | - |
dc.subject.keywordAuthor | Best-M | - |
dc.subject.keywordAuthor | limited feedback | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.