By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wen-Rong Wu ; Dept. of Commun. Eng., Nat. Chiao Tung Univ. Hsinchu, Hsinchu, Taiwan ; Tzu-Han Hsu

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.

Published in:

Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on

Date of Conference:

13-16 Sept. 2009