Paper detail

Optimal frame designs for multitasking devices with weight restrictions

Let $\mathbf d=(d_j)_{j\in\mathbb I_m}\in\mathbb N^m$ be a finite sequence (of dimensions) and $α=(α_i)_{i\in\mathbb I_n}$ be a sequence of positive numbers (of weights), where $\mathbb I_k=\{1,\ldots,k\}$ for $k\in\mathbb N$. We introduce the $(α\, , \,\mathbf d)$-designs i.e., $m$-tuples $Φ=(\mathcal F_j)_{j\in\mathbb I_m}$ such that $\mathcal F_j=\{f_{ij}\}_{i\in\mathbb I_n}$ is a finite sequence in $\mathbb C^{d_j}$, $j\in\mathbb I_m$, and such that the sequence of non-negative numbers $(\|f_{ij}\|^2)_{j\in\mathbb I_m}$ forms a partition of $α_i$, $i\in\mathbb I_n$. We characterize the existence of $(α\, , \, \mathbf d)$-designs with prescribed properties in terms of majorization relations. We show, by means of a finite-step algorithm, that there exist $(α\, , \, \mathbf d)$-designs $Φ^{\rm op}=(\mathcal F_j^{\rm op})_{j\in\mathbb I_m}$ that are universally optimal; that is, for every convex function $φ:[0,\infty)\rightarrow [0,\infty)$ then $Φ^{\rm op}$ minimizes the joint convex potential induced by $φ$ among $(α\, , \, \mathbf d)$-designs, namely $$ \sum_{j\in\mathbb I_m}\text{P}_φ(\mathcal F_j^{\rm op})\leq \sum_{j\in \mathbb I_m}\text{P}_φ(\mathcal F_j) $$ for every $(α\, , \, \mathbf d)$-design $Φ=(\mathcal F_j)_{j\in\mathbb I_m}$, where $\text{P}_φ(\mathcal F)=tr(φ(S_{\mathcal F}))$; in particular, $Φ^{\rm op}$ minimizes both the joint frame potential and the joint mean square error among $(α\, , \, \mathbf d)$-designs. We show that in this case $\mathcal F_j^{\rm op}$ is a frame for $\mathbb C^{d_j}$, for $j\in\mathbb I_m$. This corresponds to the existence of optimal encoding-decoding schemes for multitasking devices with energy restrictions.