Full metadata record
DC FieldValueLanguage
dc.contributor.authorHung, Chin-Yunen_US
dc.contributor.authorSang, Tzu-Hsienen_US
dc.date.accessioned2014-12-08T15:25:07Z-
dc.date.available2014-12-08T15:25:07Z-
dc.date.issued2006en_US
dc.identifier.isbn978-0-7803-9753-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/17488-
dc.identifier.urihttp://dx.doi.org/10.1109/ISSPIT.2006.270853en_US
dc.description.abstractMulti-Input Multi-Output (MIMO) transmission has become a popular technique to increase spectral efficiency. Meanwhile, the design of cost-effective receivers for MIMO channels remains a challenging task. Maximum-Likelihood (ML) detector can achieve superb performance, yet the computational complexity is enormously high. Receivers based on sphere decoding (SD) reach the performance of ML detectors, and potentially a great deal of computational cost can be saved. In this paper, a practical sphere-decoding algorithm is proposed. It utilizes a simple and effective way to set the initial radius which plays a decisive role in determining the computational compleidty. Furthermore, a pseudo-antenna augmentation scheme is employed such that SD can be applied where the number of receive antennas Is less than that of transmit antennas; thus enhance the applicability of this powerful algorithm.en_US
dc.language.isoen_USen_US
dc.titleA sphere decoding algorithm for MIMO channelsen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/ISSPIT.2006.270853en_US
dc.identifier.journal2006 IEEE International Symposium on Signal Processing and Information Technology, Vols 1 and 2en_US
dc.citation.spage502en_US
dc.citation.epage506en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000245867900095-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000245867900095.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.