Takano, YasuhiroYasuhiroTakanoHSUAN-JUNG SUShiraishi, YoshiakiYoshiakiShiraishiMorii, MasakatuMasakatuMorii2023-07-182023-07-182022-01-019781665480536https://scholars.lib.ntu.edu.tw/handle/123456789/633887This paper studies adaptive modulation techniques aiming to implement secure transmission in practical communication systems imposed with finite alphabet constraints. As a baseline, the logarithm barrier method is applied to solve the adaptive modulation problem formulated with an inequality constrained secrecy capacity maximization. However, the interested problem requires to jointly solve plural sub-problems to select the best alphabet-set, which incurs a high complexity issue for the baseline technique due to identifying infeasible cases. Hence, we propose a new cache-Aided power optimization algorithm that finds the optimal solution with a statistically independent complexity order of the number of the sub-problems. Simulation results obtained in MIMO-ME scenarios verify the effectiveness of the new cache-Aided bisection (C-bisect) method that it achieves normalized throughput performance of 0.95.adaptive modulation | barrier method | bisection | inequality constrained optimization | Secrecy capacityconference paper10.1109/PIMRC54779.2022.99780412-s2.0-85145665804https://api.elsevier.com/content/abstract/scopus_id/85145665804