By Topic

On the Structure of Limited-Feedback Beamforming Codebooks for Amplify-and-Forward Relay Networks

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
$33 $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)
Erdem Koyuncu ; Center for Pervasive Communications and Computing, University of California, Irvine, CA, USA ; Hamid Jafarkhani

We determine necessary conditions on the structure of symbol error rate (SER) optimal compact quantizer codebooks for limited feedback beamforming in wireless networks with one transmitter-receiver pair and R parallel amplify-and-forward relays. We call a codebook “small” if its cardinality is less than R, and “large” otherwise. A “d-codebook” depends on the power constraints and can be optimized accordingly, while an “i-codebook” remains fixed. It was previously shown that any i-codebook that contains the single-relay selection (SRS) codebook achieves the full-diversity order, R. We prove the following: Every full-diversity i-codebook contains the SRS codebook, and thus is necessarily large. In general, as the power constraints grow to infinity, the limit of an SER-optimal large d-codebook contains an SRS codebook, provided that it exists. For small codebooks, the maximal diversity is equal to the codebook cardinality. Every diversity-optimal small i-codebook is an orthogonal multiple-relay selection (OMRS) codebook. Moreover, the limit of an SER-optimal small d-codebook is an OMRS codebook. We observe that SRS is nothing but a special case of OMRS for codebooks with cardinality equal to R. As a result, we call OMRS as "the universal necessary condition" for codebook optimality. Finally, we confirm our analytical findings through simulations.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 5 )