Low-Complexity Soft-Output Sphere Decoding with Modified Repeated Tree Search Strategy
| dc.citation.epage | 54 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 51 | en_US |
| dc.citation.volume | 17 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | Shieh, Shin-Lin | en_US |
| dc.contributor.author | Chiu, Rong-Dong | en_US |
| dc.contributor.author | Feng, Shih-Lun | en_US |
| dc.contributor.author | Chen, Po-Ning | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.date.accessioned | 2014-12-08T15:29:39Z | |
| dc.date.available | 2014-12-08T15:29:39Z | |
| dc.date.issued | 2013-01-01 | en_US |
| dc.description.abstract | Many solutions for detecting signals transmitted over flat-faded multiple input multiple output (MIMO) channels have been proposed, e.g., the zero-forcing (ZF), minimum mean squared error (MMSE), sphere decoding (SD) algorithms, to name a few. These approaches however suffer from either unsatisfactory performance or high complexity. In this paper, we focus on the soft-output SD algorithm and propose a modification on the repeated tree search (RTS) strategy. It is shown that our modification can maintain a fixed upper limit in decoding complexity and results in a good performance-complexity tradeoff. | en_US |
| dc.identifier.doi | 10.1109/LCOMM.2012.112012121728 | en_US |
| dc.identifier.issn | 1089-7798 | en_US |
| dc.identifier.journal | IEEE COMMUNICATIONS LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/LCOMM.2012.112012121728 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/21292 | |
| dc.identifier.wosnumber | WOS:000314713700014 | |
| dc.language.iso | en_US | en_US |
| dc.subject | MIMO | en_US |
| dc.subject | sphere decoding | en_US |
| dc.subject | repeated tree search | en_US |
| dc.title | Low-Complexity Soft-Output Sphere Decoding with Modified Repeated Tree Search Strategy | en_US |
| dc.type | Article | en_US |