Sphere decoding with a probabilistic tree pruning
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shim, Byonghyo | - |
dc.contributor.author | Kang, Insung | - |
dc.date.accessioned | 2021-09-09T03:51:07Z | - |
dc.date.available | 2021-09-09T03:51:07Z | - |
dc.date.created | 2021-06-10 | - |
dc.date.issued | 2008-10 | - |
dc.identifier.issn | 1053-587X | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/122602 | - |
dc.description.abstract | In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | LATTICE CODE DECODER | - |
dc.subject | ALGORITHMS | - |
dc.subject | COMPLEXITY | - |
dc.subject | SEARCH | - |
dc.subject | REDUCTION | - |
dc.title | Sphere decoding with a probabilistic tree pruning | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shim, Byonghyo | - |
dc.identifier.doi | 10.1109/TSP.2008.923808 | - |
dc.identifier.scopusid | 2-s2.0-53149108983 | - |
dc.identifier.wosid | 000259407300027 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.56, no.10, pp.4867 - 4878 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON SIGNAL PROCESSING | - |
dc.citation.title | IEEE TRANSACTIONS ON SIGNAL PROCESSING | - |
dc.citation.volume | 56 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 4867 | - |
dc.citation.endPage | 4878 | - |
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.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | LATTICE CODE DECODER | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordPlus | REDUCTION | - |
dc.subject.keywordAuthor | lattice | - |
dc.subject.keywordAuthor | maximum likelihood decoding | - |
dc.subject.keywordAuthor | multiple-input-multiple-output (MIMO) system | - |
dc.subject.keywordAuthor | probabilistic noise constraint | - |
dc.subject.keywordAuthor | probabilistic tree pruning | - |
dc.subject.keywordAuthor | sphere constraint | - |
dc.subject.keywordAuthor | sphere decoding (SD) | - |
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.