REDUCED COMPLEXITY MULTIMODE ANTENNA SELECTION WITH BIT ALLOCATION FOR ZERO-FORCING RECEIVER
檔案
本條目沒有附加檔案。
日期
2012
類型
系所
期刊名稱
2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)
卷期與頁次
頁 2937–2940
ISBN
978-1-4673-0046-9
語言
英文
摘要
In this paper, we investigate multimode antenna selection for zero forcing receiver to maximize the overall data rate. The optimal selection scenario can be achieved by exhaustive search. However, antenna selection using exhaustive search leads to complicated computational burden. To reduce the complexity, we propose a greedy search algorithm for antenna selection. Using the proposed algorithm, the computations can be greatly reduced while the achievable data rate is nearly the same with exhaustive search. Moreover, generally fixed bit budgets are used in practical design. Hence, we propose to use water-filling bit allocation to further improve the performance of the proposed antenna selection scheme. Simulation results are provided to show the advantages of the proposed multimode antenna selection with bit allocation.
所屬典藏
會議論文引用此條目
Yeh, W.-C., Tsai, S.-H., & Lin, P.-H. (2012). REDUCED COMPLEXITY MULTIMODE ANTENNA SELECTION WITH BIT ALLOCATION FOR ZERO-FORCING RECEIVER. 2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2937–2940. https://ir.lib.nycu.edu.tw/handle/11536/20983
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/20983