Probability modelled optimal frames for erasures

Abstract We establish a probability model for constructing optimal Parseval frames when erasures occur during the transmission process of the frame coefficient data set. Such frames are called probability modelled (PM) optimal frames for erasures. While (PM) optimal frames exist for all erasures, it is usually difficult to construct them. We characterize all the PM optimal frames for one and two erasures, and propose an algorithm to construct these frames. Examples are given to demonstrate the construction and to compare the decoding/reconstruction effects when both PM optimal Parseval frames and uniform length Parseval frames are used for encoding.

[1]  V. Paulsen,et al.  Frames, graphs and erasures , 2004, math/0406134.

[2]  Peter G. Casazza,et al.  Duality Principles in Frame Theory , 2004 .

[3]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[4]  Deguang Han,et al.  Optimal dual frames for erasures , 2010 .

[5]  Peter G. Casazza,et al.  Equal-Norm Tight Frames with Erasures , 2003, Adv. Comput. Math..

[6]  Jinsong Leng,et al.  Orthogonal projection decomposition of matrices and construction of fusion frames , 2013, Adv. Comput. Math..

[7]  B. Bodmann.  Optimal linear transmission by loss-insensitive packet encoding☆ , 2007 .

[8]  Jinsong Leng,et al.  Optimal Dual Frames for Communication Coding With Probabilistic Erasures , 2011, IEEE Transactions on Signal Processing.

[9]  Vivek K Goyal,et al.  Quantized Frame Expansions with Erasures , 2001 .

[10]  P. Terekhin.  Frames in Banach spaces , 2010 .

[11]  Deguang Han,et al.  The uniqueness of the dual of Weyl-Heisenberg subspace frames , 2004 .

[12]  V. Paulsen,et al.  Optimal frames for erasures , 2004 .

[13]  M. Ehler,et al.  Minimization of the probabilistic p-frame potential , 2010, 1101.0140.

[14]  Christine Bachoc,et al.  Tight p-fusion frames , 2012, ArXiv.

[15]  R. Calderbank,et al.  Robust dimension reduction, fusion frames, and Grassmannian packings , 2007, 0709.2340.

[16]  Martin Ehler,et al.  Frame theory in directional statistics , 2010, 1101.0122.

[17]  Ian J. Wassell,et al.  Randomly select and forward: Erasure probability analysis of a probabilistic relay channel model , 2009, 2009 IEEE Information Theory Workshop.

[18]  N. J. A. Sloane,et al.  Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 1996, Exp. Math..

[19]  Deguang Han.  Classification of Finite Group-Frames and Super-Frames , 2007, Canadian Mathematical Bulletin.

[20]  C. H. Bennett,et al.  Capacities of Quantum Erasure Channels , 1997, quant-ph/9701015.

[21]  Zhiming Xu,et al.  Frame-Theoretic Analysis of Robust Filter Bank Frames to Quantization and Erasures , 2010, IEEE Transactions on Signal Processing.

[22]  Bernhard G. Bodmann,et al.  Frame paths and error bounds for sigma–delta quantization☆ , 2007 .

[23]  Israel Cidon,et al.  Erasure, capture, and random power level selection in multiple-access systems , 1988, IEEE Trans. Commun..

[24]  Jelena Kovacevic,et al.  Real, tight frames with maximal robustness to erasures , 2005, Data Compression Conference.

[25]  Yonina C. Eldar,et al.  Geometrically uniform frames , 2001, IEEE Trans. Inf. Theory.

[26]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[27]  Deepti Kalra,et al.  Complex equiangular cyclic frames and erasures , 2006 .

[28]  M. Ehler.  Random Tight Frames , 2011, Journal of Fourier Analysis and Applications.

[29]  Peter F. Driessen.  Performance of frame synchronization in packet transmission using bit erasure information , 1991, IEEE Trans. Commun..

[30]  Deguang Han,et al.  Frames for Undergraduates , 2007 .

[31]  Amin Shokrollahi,et al.  Raptor codes , 2011, IEEE Transactions on Information Theory.