摘要
In this paper, we propose a fast algorithm to quickly search the best codeword in a given codebook for MIMO beamforming systems. The proposed algorithm can effectively reduce the computational complexity and feedback latency for various codebooks. Moreover, we analyze both the complexity and the performance for the proposed algorithm. From the complexity analysis, we found that around half of the computational complexity will be reduced in each iteration. From the performance analysis, we found that as the number of quantization bits increases, the analytical result is close to the simulation result. Simulation results are provided to evaluate the proposed algorithm in several beamforming scenarios.
| 原文 | English |
|---|---|
| 頁面 | 185-188 |
| 頁數 | 4 |
| 出版狀態 | Published - 12月 2010 |
| 事件 | 2nd Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2010 - Biopolis, Singapore 持續時間: 14 12月 2010 → 17 12月 2010 |
Conference
| Conference | 2nd Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2010 |
|---|---|
| 國家/地區 | Singapore |
| 城市 | Biopolis |
| 期間 | 14/12/10 → 17/12/10 |