On Further Reduction of Complexity in Tree Pruning Based Sphere Search
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shim, Byonghyo | - |
dc.contributor.author | Kang, Insung | - |
dc.date.accessioned | 2021-09-08T05:15:43Z | - |
dc.date.available | 2021-09-08T05:15:43Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-02 | - |
dc.identifier.issn | 0090-6778 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/117024 | - |
dc.description.abstract | In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational complexity with minimal extra cost and negligible performance penalty. In contrast to the PTP-SD that considers the tightening of necessary conditions in the sphere search using per-layer radius adjustment, the proposed method focuses on the sphere radius control strategy when a candidate lattice point is found. For this purpose, the dynamic radius update strategy depending on the lattice point found as well as the lattice independent radius selection scheme are jointly exploited. As a result, while maintaining the effectiveness of the PTP-SD, further reduction of the computational complexity, in particular for high SNR regime, can be achieved. From simulations in multiple-input and multiple-output (MIMO) channels, it is shown that the proposed method provides a considerable improvement in complexity with near-ML performance. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | NEAR-CAPACITY | - |
dc.subject | LATTICE POINT | - |
dc.subject | ALGORITHMS | - |
dc.title | On Further Reduction of Complexity in Tree Pruning Based Sphere Search | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shim, Byonghyo | - |
dc.identifier.doi | 10.1109/TCOMM.2010.02.080340 | - |
dc.identifier.scopusid | 2-s2.0-76949098084 | - |
dc.identifier.wosid | 000276330800007 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMMUNICATIONS, v.58, no.2, pp.417 - 422 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.title | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.volume | 58 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 417 | - |
dc.citation.endPage | 422 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | NEAR-CAPACITY | - |
dc.subject.keywordPlus | LATTICE POINT | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Sphere decoding | - |
dc.subject.keywordAuthor | multiple input multiple output | - |
dc.subject.keywordAuthor | maximum likelihood decoding | - |
dc.subject.keywordAuthor | sphere radius | - |
dc.subject.keywordAuthor | probabilistic tree pruning | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. 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.