Grassmannian Frames with Applications to Coding and Communication

For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These bounds yield a simple condition under which Grassmannian frames coincide with uniform tight frames. We exploit connections to graph theory, equiangular line sets, and coding theory in order to derive explicit constructions of Grassmannian frames. Our findings extend recent results on uniform tight frames. We then introduce infinite-dimensional Grassmannian frames and analyze their connection to uniform tight frames for frames which are generated by group-like unitary systems. We derive an example of a Grassmannian Gabor frame by using connections to sphere packing theory. Finally we discuss the application of Grassmannian frames to wireless communication and to multiple description coding.Comment: Submitted in June 2002 to Appl. Comp. Harm. Ana

Mini-Workshop: Algebraic, Geometric, and Combinatorial Methods in Frame Theory

Frames are collections of vectors in a Hilbert space which have reconstruction properties similar to orthonormal bases and applications in areas such as signal and image processing, quantum information theory, quantization, compressed sensing, and phase retrieval. Further desirable properties of frames for robustness in these applications coincide with structures that have appeared independently in other areas of mathematics, such as special matroids, Gel’Fand-Zetlin polytopes, and combinatorial designs. Within the past few years, the desire to understand these structures has led to many new fruitful interactions between frame theory and fields in pure mathematics, such as algebraic and symplectic geometry, discrete geometry, algebraic combinatorics, combinatorial design theory, and algebraic number theory. These connections have led to the solutions of several open problems and are ripe for further exploration. The central goal of our mini-workshop was to attack open problems that were amenable to an interdisciplinary approach combining certain subfields of frame theory, geometry, and combinatorics

Introduction to frames

This survey gives an introduction to redundant signal representations called frames. These representations have recently emerged as yet another powerful tool in the signal processing toolbox and have become popular through use in numerous applications. Our aim is to familiarize a general audience with the area, while at the same time giving a snapshot of the current state-of-the-art