Grassmannian frames with applications to coding and communication

From MaRDI portal




Abstract: For a given class calF of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation |<fk,fl>| among all frames fkkincalIincalF. 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.



Cites work


Cited in
(only showing first 100 items - show all)






This page was built for publication: Grassmannian frames with applications to coding and communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399700)