Non-orthogonal fusion frames and the sparsity of fusion frame operators

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Fusion frames have become a major tool in the implementation of distributed systems. The effectiveness of fusion frame applications in distributed systems is reflected in the efficiency of the end fusion process. This in turn is reflected in the efficiency of the inversion of the fusion frame operator $S_{\cW}$, which in turn is heavily dependent on the sparsity of $S_{\cW}$. We will show that sparsity of the fusion frame operator naturally exists by introducing a notion of {\it non-orthogonal fusion frames}. We show that for a fusion frame $\{W_i,v_i\}_{i\in I}$, if $\text{dim}(W_i)=k_i$, then the matrix of the non-orthogonal fusion frame operator $\cSw$ has in its corresponding location at most a $k_i\times k_i$ block matrix. We provide necessary and sufficient conditions for which the new fusion frame operator $\cSw$ is diagonal and/or a multiple of an identity. A set of other critical questions are also addressed. A scheme of {\it multiple fusion frames} whose corresponding fusion frame operator becomes an diagonal operator is also examined.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Non-orthogonal fusion frames and the sparsity of fusion frame operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-orthogonal fusion frames and the sparsity of fusion frame operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-orthogonal fusion frames and the sparsity of fusion frame operators will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-480784

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.