Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Jun Won | - |
dc.contributor.author | Shim, Byonghyo | - |
dc.contributor.author | Singer, Andrew C. | - |
dc.contributor.author | Cho, Nam Ik | - |
dc.date.accessioned | 2021-09-08T04:41:07Z | - |
dc.date.available | 2021-09-08T04:41:07Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 1053-587X | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/116847 | - |
dc.description.abstract | In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i. e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on M-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) (10(-1) similar to 10(-4)), while limiting performance loss to within 1 dB from ML detection. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | DETECTION ALGORITHMS | - |
dc.subject | SPHERE | - |
dc.subject | LATTICE | - |
dc.subject | CAPACITY | - |
dc.title | Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shim, Byonghyo | - |
dc.identifier.doi | 10.1109/TSP.2009.2036482 | - |
dc.identifier.scopusid | 2-s2.0-79956257703 | - |
dc.identifier.wosid | 000274395000028 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.58, no.3, pp.1780 - 1793 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON SIGNAL PROCESSING | - |
dc.citation.title | IEEE TRANSACTIONS ON SIGNAL PROCESSING | - |
dc.citation.volume | 58 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 1780 | - |
dc.citation.endPage | 1793 | - |
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 | DETECTION ALGORITHMS | - |
dc.subject.keywordPlus | SPHERE | - |
dc.subject.keywordPlus | LATTICE | - |
dc.subject.keywordPlus | CAPACITY | - |
dc.subject.keywordAuthor | Dimension reduction | - |
dc.subject.keywordAuthor | list tree search | - |
dc.subject.keywordAuthor | maximum-likelihood (ML) decoding | - |
dc.subject.keywordAuthor | minimum mean square error (MMSE) | - |
dc.subject.keywordAuthor | multiple input multiple output (MIMO) | - |
dc.subject.keywordAuthor | sphere decoding | - |
dc.subject.keywordAuthor | stack algorithm | - |
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.