Codebook-based lattice-reduction-aided precoding for limited-feedback coded MIMO systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, H.J. | - |
dc.contributor.author | Chun, J. | - |
dc.contributor.author | Choi, Y. | - |
dc.contributor.author | Kim, S. | - |
dc.contributor.author | Paulraj, A. | - |
dc.date.accessioned | 2021-08-03T05:42:52Z | - |
dc.date.available | 2021-08-03T05:42:52Z | - |
dc.date.issued | 2012 | - |
dc.identifier.issn | 0090-6778 | - |
dc.identifier.issn | 1558-0857 | - |
dc.identifier.uri | https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/1040 | - |
dc.description.abstract | Lattice-reduction-aided precoding (LRP) provides near-capacity rates with the use of low-complexity linear receivers for coded multiple-input multiple-output (MIMO) systems. However, a large amount of feedback in the feedback for an integer or binary precoding matrix has been a bottleneck in its implementation. In this paper, we propose a codebook-based LRP scheme for limited-feedback coded MIMO systems. The proposed LRP scheme follows the fundamentals of the previous LRP scheme that employed multilevel binary coset coding so that the precoding matrix is binary. In the proposed LRP scheme, the conventional precoding matrix obtained from the Lenstra-Lenstra-Lov?sz algorithm is modified to specific forms that are predefined in a codebook set. The new precoding matrix is selected such that the lower bound on the capacity is maximized for a given codebook set, while the codebook set is designed offline such that the upper bound of the average capacity loss induced by the limitation on the codebook size is minimized. The simulation results show that the proposed LRP scheme nearly achieves the achievable rate of the conventional LRP scheme with a greatly reduced amount of feedback. ? 2012 IEEE. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.title | Codebook-based lattice-reduction-aided precoding for limited-feedback coded MIMO systems | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TCOMM.2011.122111.100489 | - |
dc.identifier.scopusid | 2-s2.0-84857373770 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Communications, v.60, no.2, pp 510 - 524 | - |
dc.citation.title | IEEE Transactions on Communications | - |
dc.citation.volume | 60 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 510 | - |
dc.citation.endPage | 524 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Achievable rate | - |
dc.subject.keywordPlus | Average capacities | - |
dc.subject.keywordPlus | Codebooks | - |
dc.subject.keywordPlus | Coded MIMO systems | - |
dc.subject.keywordPlus | Lattice-reduction (LR)-aided precoding | - |
dc.subject.keywordPlus | Lattice-reduction-aided | - |
dc.subject.keywordPlus | Limitedfeedback | - |
dc.subject.keywordPlus | Linear receiver | - |
dc.subject.keywordPlus | Low-complexity | - |
dc.subject.keywordPlus | Lower bounds | - |
dc.subject.keywordPlus | Multiple-input-multiple-output | - |
dc.subject.keywordPlus | Multiple-input-multiple-output systems | - |
dc.subject.keywordPlus | Offline | - |
dc.subject.keywordPlus | Precoding | - |
dc.subject.keywordPlus | Precoding matrix | - |
dc.subject.keywordPlus | Upper Bound | - |
dc.subject.keywordPlus | MIMO systems | - |
dc.subject.keywordPlus | Matrix algebra | - |
dc.subject.keywordAuthor | Lattice-reduction (LR)-aided precoding | - |
dc.subject.keywordAuthor | Limitedfeedback | - |
dc.subject.keywordAuthor | Linear multiple-input multiple-output (MIMO) detection | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(34103) 대전광역시 유성구 유성대로1312번길 32042-866-3114
COPYRIGHT 2021 BY KOREA RESEARCH INSTITUTE OF SHIPS & OCEAN ENGINEERING. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.