Name
Title | ||
|---|---|---|
Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ICASSP.2012.6288531 | ICASSP |
Keywords | Field | DocType |
greedy search algorithm,multimode antenna selection,zero-forcing receiver,exhaustive search,bit allocation,antenna arrays,computational complexity,mimo communication,optimal selection scenario,water-filling bit allocation,mimo systems,complexity reduction,vectors,mimo | Mathematical optimization,Brute-force search,Computer science,MIMO,Greedy algorithm,Bit allocation,Zero Forcing Equalizer,Multi-mode optical fiber,Computational complexity theory,Computation | Conference |
ISSN | ISBN | Citations |
1520-6149 E-ISBN : 978-1-4673-0044-5 | 978-1-4673-0044-5 | 2 |
PageRank | References | Authors |
0.38 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wan-Chen Yeh | 1 | 2 | 0.38 |
| Shang-ho Tsai | 2 | 188 | 24.44 |
| Pu-Hsuan Lin | 3 | 21 | 2.19 |