Asymptotic bound of secrecy capacity for MIMOME-based transceivers: a suboptimally tractable solution for imperfect CSI (Q1992649)

Summary: The paper principally proposes a suboptimally closed-form solution in terms of a general asymptotic bound of the secrecy capacity in relation to MIMOME-based transceivers. Such pivotal solution is essentially tight as well, fundamentally originating from the principle \textit{convexity}. The resultant novelty, per se, is strictly necessary since the absolutely central criterion \textit{imperfect knowledge} of the wiretap channel at the transmitter should also be highly regarded. Meanwhile, ellipsoidal channel uncertainty set-driven strategies are physically taken into consideration. Our proposed solution is capable of perfectly being applied for other general equilibria such as multiuser ones. In fact, this in principle addresses an entirely appropriate alternative for worst-case method-driven algorithms utilising some provable inequality-based mathematical expressions. Our framework is adequately guaranteed regarding a totally acceptable outage probability (as 1 -- preciseness coefficient). The relative value is almost 10\% for the estimation error values (EEVs) \( \leqslant 0.5\) for \(2 \times 2\)-based transceivers, which is noticeably reinforced at nearly 5\% for EEVs \(\leqslant 0.9\) for the case \(4 \times 4\). Furthermore, our proposed scheme basically guarantees the secrecy outage probability (SOP) less than 0.05\% for the case of having EEVs \(\leqslant 0.3\), for the higher power regime.