Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver

Wan Chen Yeh; Shang-Ho Tsai; Pu Hsuan Lin

doi:10.1109/ICASSP.2012.6288531

Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver

Wan Chen Yeh^*, Shang-Ho Tsai, Pu Hsuan Lin

^*Corresponding author for this work

電機工程學系

研究成果: Conference contribution › 同行評審

1 引文斯高帕斯（Scopus）

摘要

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.

原文	English
主出版物標題	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings
頁面	2937-2940
頁數	4
DOIs	https://doi.org/10.1109/ICASSP.2012.6288531
出版狀態	Published - 23 十月 2012
事件	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Kyoto, Japan 持續時間: 25 三月 2012 → 30 三月 2012

出版系列

名字	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN（列印）	1520-6149

Conference

Conference	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012
國家	Japan
城市	Kyoto
期間	25/03/12 → 30/03/12

存取文件

10.1109/ICASSP.2012.6288531

Link to publication in Scopus

指紋深入研究「Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver」主題。共同形成了獨特的指紋。

引用此

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 2012 - Proceedings (頁 2937-2940). [6288531] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2012.6288531

@inproceedings{32245432e853426f8caf1081a9791b41,

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.",

keywords = "bit allocation, MIMO systems, multimode antenna selection, zero-forcing receiver",

author = "Yeh, {Wan Chen} and Shang-Ho Tsai and Lin, {Pu Hsuan}",

year = "2012",

month = oct,

day = "23",

doi = "10.1109/ICASSP.2012.6288531",

language = "English",

isbn = "9781467300469",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

pages = "2937--2940",

booktitle = "2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings",

note = "null ; Conference date: 25-03-2012 Through 30-03-2012",

}

Yeh, WC, Tsai, S-H & Lin, PH 2012, Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver. 於 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings., 6288531, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 頁 2937-2940, 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012, Kyoto, Japan, 25/03/12. https://doi.org/10.1109/ICASSP.2012.6288531

Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver. / Yeh, Wan Chen; Tsai, Shang-Ho; Lin, Pu Hsuan.

2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings. 2012. p. 2937-2940 6288531 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

研究成果: Conference contribution › 同行評審

TY - GEN

T1 - Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver

AU - Yeh, Wan Chen

AU - Tsai, Shang-Ho

AU - Lin, Pu Hsuan

PY - 2012/10/23

Y1 - 2012/10/23

N2 - 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.

AB - 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.

KW - bit allocation

KW - MIMO systems

KW - multimode antenna selection

KW - zero-forcing receiver

UR - http://www.scopus.com/inward/record.url?scp=84867596032&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2012.6288531

DO - 10.1109/ICASSP.2012.6288531

M3 - Conference contribution

AN - SCOPUS:84867596032

SN - 9781467300469

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 2937

EP - 2940

BT - 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings

Y2 - 25 March 2012 through 30 March 2012

ER -

Yeh WC, Tsai S-H, Lin PH. Reduced complexity multimode antenna selection with bit allocation for zero-forcing receiver. 於 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings. 2012. p. 2937-2940. 6288531. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2012.6288531