5 problems

Clustered-system DMT conjecture. The theorem stating that, for the clustered system, the DMT formula given for $m=1,2$ holds is true for arbitrary $(m,n,k)$.

Let $N_t(\lambda)$ and $N_r(\lambda)$ be the numbers of transmit and receive antennas, respectively, with … Consider eigenbeamforming with a single data stream and a physically fea…

Maximal-subset-property conjecture. If $k$ is slightly larger than $n$, then with high probability the only optima of the optimization problem are

Consider a symmetric $(n,k,n)$ half-duplex MIMO relay channel, meaning that the source and destination each have $n$ antennas and the relay has $k$ antennas. Let $d^*(r)$ denote it…

Let an $(m,k,n)$ half-duplex MIMO relay channel (HD-RC) have $m$, $k$, and $n$ antennas at its three nodes, and let its diversity–multiplexing tradeoff (DMT) be compared with that…