Constructing packings in grassmannian manifolds via alternating projection

Experimental Mathematics

Volumn 17, Issue 1, 2008, Pages 9-35

  Dhillon, I S ^a   Heath, R W ^b   Strohmer, T ^c   Tropp, J A ^d  

^a University of Texas at Austin   (United States)

^b The University of Texas at Austin   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorial optimization; Grassmannian spaces; Packing; Projective spaces; Tammes problem

Indexed keywords

EID: 44249089528     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2008.10129018     Document Type: Article

References (36)

1. D. Agrawal, T. J. Richardson, and R. L. Urbanke. “Multiple-Antenna Signal Constellations for Fading Channels.” IEEE Trans. Inform. Theory 6:47 (2001), 2618–2626.
2. A. Barg and D. Yu. Nogin. “Bounds on Packings of Spheres in the Grassmannian Manifold.” IEEE Trans. Inform. Theory 48:9 (2002), 2450–2454.
3. Å. Björck and G. Golub. “Numerical Methods for Computing Angles between Linear Subspaces.” Mathematics of Computation 123:27 (1973), 579–594.
4. E. W. Cheney and A. A. Goldstein. “Proximity Maps for Convex Sets.” Proc. Amer. Math. Soc. 10:3 (1959), 448–450.
5. J. H. Conway and N. J. A. Sloane. Sphere Packing, Lattices and Groups, 3rd edition, Grundlehren der mathematischen Wissenschaften, 290. New York: Springer-Verlag, 1998.
6. J. H. Conway, R. H. Hardin, and N. J. A. Sloane. “Packing Lines, Planes, etc.: Packings in Grassmannian Spaces.” Experimental Math. 5:2 (1996), 139–159.
7. T. M. Cover and J. A. Thomas. Elements of Information Theory. New York: John Wiley and Sons, 1991.
8. T. Ericson and V. Zinoviev. Codes on Euclidean Spheres. Amsterdam: Elsevier, 2001.
9. G. H. Golub and C. F. Van Loan. Matrix Computations, 3rd edition. Baltimore: Johns Hopkins University Press, 1996.
10. T. C. Hales. “A Proof of the Kepler Conjecture (DCG Version).” Available online (http://www.math.pitt.edu/∼thales/kepler04/fullkepler.pdf), 2004.
11. B.M. Hochwald and T.L. Marzetta. “Unitary Space-Time Modulation for Multiple- Antenna Communications in Rayleigh Flat Fading.” IEEE Trans. Info. Theory 46:2 (2000), 543–564.
12. B. M. Hochwald, T. L. Marzetta, T. J. Richardson, W. Sweldens, and R. Urbanke. “Systematic Design of Unitary Space-Time Constellations.” IEEE Trans. Inform. Theory 46:6 (2000), 1962–1973.
13. R. B. Holmes and V. I. Paulsen. “Optimal Frames for Erasures.” Linear Algebra Appl. 377 (2004), 31–51.
14. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge: Cambridge University Press, 1985.
15. P. W. H. Lemmens and J. J. Seidel. “Equi-isoclinic Subspaces of Euclidean Spaces.” Proc. Nederl. Akad. Wetensch. Series A 76 (1973), 98–107.
16. D. J. Love and R. W. Heath Jr. “Limited Feedback Unitary Precoding for Orthogonal Space- Time Block Codes.” IEEE Trans. Signal Processing 53:1 (2005), 64–73.
17. D. J. Love and R. W. Heath Jr. “Limited Feedback Unitary Precoding for Spatial Multiplexing Systems.” IEEE Trans. Info. Theory 51:8 (2005), 2967–2976.
18. D. J. Love, R.W. Heath Jr., and T. Strohmer. “Grassmannian Beamforming for Multiple-Input Multiple- Output Wireless Systems.” IEEE Trans. Info. Theory 49:10 (2003), 2735–2747.
19. D. J. Love, R. W. Heath Jr., W. Santipach, M. L. Honig. “What Is the Value of Limited Feedback for MIMO Channels?” IEEE Comm. Mag. 42:10 (2004), 54–59.
20. R. R. Meyer. “Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms.” J. Comp. Sys. Sci. 12 (1976), 108–121.
21. J. von Neumann. Functional Operators, vol. II, Annals of Mathematics Studies, 22. Princeton: Princeton University Press, 1950.
22. R. A. Rankin. “On the Closest Packing of Spheres in n Dimensions.” Ann. Math. 48 (1947), 1062–1081.
23. R. T. Rockafellar. Convex Analysis. Princeton: Princeton University Press, 1970.
24. C. A. Rogers. Packing and Covering. Cambridge: Cambridge University Press, 1964.
25. N. J. A. Sloane. “Table of Best Grassmannian Packings.” Available online (http://www.research.att.com/∼njas/grass/grassTab.html), 2004.
26. N. J. A. Sloane. “Tables of Spherical Codes.” Available online (http://www.research.att.com/∼njas/packings/), 2004.
27. G. W. Stewart “The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimation.” SIAM J. Numer. Anal. 17:30 (1980), 403–409.
28. T. Strohmer and R. W. Heath Jr. “Grassmannian Frames with Applications to Coding and Communication.” Appl. Comp. Harmonic Anal. 14:3 (2003), 257–275.
29. M. A. Sustik, J. A. Tropp, I. S. Dhillon, and R. W. Heath Jr. “On the Existence of Equiangular Tight Frames.” Linear Algebra Appl. 426:2–3 (2007), 619–635.
30. P. M. L. Tammes. “On the Origin of Number and Arrangement of the Places of Exit on the Surface of Pollen Grains.” Rec. Trav. Bot. Neerl. 27 (1930) 1–84.
31. L. Fejes Tóth. Regular Figures. New York: Macmillan, 1964.
32. L. Fejes Tóth. “Distribution of Points in the Elliptic Plane.” Acta Math. Acad. Hung. Sci. 16 (1965), 437–440.
33. J. A. Tropp, I. S. Dhillon, R. W. Heath Jr., T. Strohmer. “Designing Structured Tight Frames via Alternating Projection.” IEEE Trans. Info. Theory 51:1 (2005), 188–209.
34. M. W. Trosset. “Approximate Maximin Distance Designs.” In Proceedings of the Section on Physical and Engineering Sciences, pp. 223–227. Alexandria, VA: American Statistical Association, 2001.
35. IEEE WirelessMAN. “Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems.” IEEE P802.16e/D8, May 2005.
36. L. Zheng and D. N. C. Tse. “Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel.” IEEE Trans. Info. Theory 48:2 (2002), 359–383.