完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, Kai-Jiunen_US
dc.contributor.authorTsai, Shang-Hoen_US
dc.date.accessioned2019-04-02T05:58:27Z-
dc.date.available2019-04-02T05:58:27Z-
dc.date.issued2018-12-01en_US
dc.identifier.issn0018-9545en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TVT.2018.2874044en_US
dc.identifier.urihttp://hdl.handle.net/11536/148626-
dc.description.abstractThis paper proposes an efficient pruning algorithm for MIMO detector, which not only achieves the same performance of the maximum likelihood (ML) decoder, but also massively reduces the number of visiting nodes. The proposed algorithm applies correct sorting order so that it achieves the same performance of the ML decoder. Thanks to the use of the correct ordering, both child and sibling nodes can be pruned efficiently. As a result, the number of visiting nodes is significantly reduced. To acquire properly sorted order, we propose fast sorting algorithms that generate the exact sorted sequence. Furthermore, the proposed schemes can be applied in SISO MIMO detector. The advantages of the proposed sphere decoder become more pronounced in high-order modulation schemes.en_US
dc.language.isoen_USen_US
dc.subjectML detectoren_US
dc.subjectorder sortingen_US
dc.subjectsphere decodingen_US
dc.titleMaximum Likelihood and Soft Input Soft Output MIMO Detection at a Reduced Complexityen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TVT.2018.2874044en_US
dc.identifier.journalIEEE TRANSACTIONS ON VEHICULAR TECHNOLOGYen_US
dc.citation.volume67en_US
dc.citation.spage12389en_US
dc.citation.epage12393en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000454112100091en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文