A low-complexity precoder searching algorithm for MIMO-OFDM systems

Wen-Rong Wu*, Tzu Han Hsu

*此作品的通信作者

研究成果: Conference contribution同行評審

2 引文 斯高帕斯(Scopus)

摘要

Precoding is an effective technique enhancing the performance of MIMO-OFDM systems. In practical systems, the precoding matrix is computed at the receiver, and then fed back to the transmitter. To reduce the amount of the feedback data, only the index representing a quantized precoding matrix is fed back. The quantized matrix is selected from a set of predetermined matrices called a codebook. Since the number of matrices in the codebook may be large, the search for the optimum precoder requires a high computational complexity. In this paper, we propose a low-complexity precoder searching algorithm to solve the problem. The basic idea is to construct a tree-like search strategy such that the complexity can be reduced from O(L)is O(log2(L)) where L is the number of the codewords. Compared to the exhaustive search, the proposed searching method can reduce the searching complexity significantly while the performance loss is small.

原文English
主出版物標題2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
DOIs
出版狀態Published - 1 12月 2009
事件2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009 - Tokyo, Japan
持續時間: 13 9月 200916 9月 2009

出版系列

名字IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
國家/地區Japan
城市Tokyo
期間13/09/0916/09/09

指紋

深入研究「A low-complexity precoder searching algorithm for MIMO-OFDM systems」主題。共同形成了獨特的指紋。

引用此