完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Chun-Taoen_US
dc.contributor.authorWu, Wen-Rongen_US
dc.date.accessioned2014-12-08T15:24:36Z-
dc.date.available2014-12-08T15:24:36Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-5123-4en_US
dc.identifier.urihttp://hdl.handle.net/11536/17071-
dc.identifier.urihttp://dx.doi.org/10.1109/PIMRC.2009.5449775en_US
dc.description.abstractAntenna selection is a simple but effective method to exploit the transmit diversity in multiple-input multiple-output (MIMO) wireless communications. For maximum-likelihood (ML) detectors, the criterion for the selection is to maximize the free distance of the MIMO system. Since the optimum selection is difficult to conduct, a lower bound of the free distance is typically used as the selection criterion instead. The singular-value-decomposition (SVD) based selection criterion is well known in the literature. In this paper, we propose a QR decomposition (QRD) based selection criterion for antenna selection with the ML detector. Using some matrix properties, we theoretically prove that the lower bound achieved with the QRD-based criterion is tighter than that with the SVD-based criterion. We also propose another QRD-based criterion that can further tighten the lower bound. The proposed algorithms can be directly applied to the receive, and joint transmit/receive antenna selection schemes. Simulations show that the performance of the proposed selection criteria can significantly outperform the SVD-based selection criterion.en_US
dc.language.isoen_USen_US
dc.titleQRD-based Antenna Selection for Maximum-Likelihood MIMO Detectionen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/PIMRC.2009.5449775en_US
dc.identifier.journal2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONSen_US
dc.citation.spage2016en_US
dc.citation.epage2020en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000305824602007-
顯示於類別:會議論文


文件中的檔案:

  1. 000305824602007.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。