By Topic

Beamforming Codebooks for Two Transmit Antenna Systems Based on Optimum Grassmannian Packings

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

5 Author(s)
Renaud-Alexandre Pitaval ; Department of Communications and Networking, School of Electrical Engineering, Aalto University, Finland ; Helka-Liina Maattanen ; Karol Schober ; Olav Tirkkonen
more authors

Precoding codebook design for limited feedback MIMO systems is known to reduce to a discretization problem on a Grassmann manifold. The case of two-antenna beamforming is special in that it is equivalent to quantizing the real sphere. The isometry between the Grassmannian G2,1 and the real sphere S2 shows that discretization problems in the Grassmannian G2,1 are directly solved by corresponding spherical codes. Notably, the Grassmannian line packing problem in ℂ2, namely maximizing the minimum distance, is equivalent to the Tammes problem on the real sphere, so that optimum spherical packings give optimum Grassmannian packings. Moreover, a simple isomorphism between G2,1 and S2 enables to analytically derive simple codebooks in closed-form having low implementation complexity. Using the simple geometry of some of these codebooks, we derive closed-form expressions of the probability density function of the relative SNR loss due to limited feedback. We also investigate codebooks based on other spherical arrangements, such as solutions maximizing the harmonic mean of the mutual distances among the codewords, which is known as the Thomson problem. We find that in some special cases, Grassmannian codebooks based on these other spherical arrangements outperform codebooks from Grassmannian packing.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 10 )