Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI

  • Jianfei YanEmail author
  • Zhishan Deng
  • Qinbo Chen
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 262)


In this research, we investigate the secrecy sum rate optimization problem for a multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) system with orthogonal space-time block codes (OSTBC). We construct a model where the transmitter and the relay send information by employing OSTBC, while both the source and the relay have imperfect channel state information (CSI) of the eavesdropper. The precoders and the power allocation scheme are jointly designed to maximize the achievable secrecy sum rate subject to the power constraints and the minimum transmission rate requirements of the weak user. To solve this non-convex problem, we propose the constrained concave convex procedure (CCCP)-based iterative algorithm and the alternative optimization (AO) method, where the closed-form expression for power allocation is derived. The simulation results demonstrate the superiority of our proposed scheme.


Multiple-input Multiple-output (MIMO) Relay Non-orthogonal multiple access (NOMA) Orthogonal space-time block codes (OSTBC) Secrecy sum rate Imperfect CSI 



This work was supported in part by the National Natural Science Foundation of China (No. 61672549, No. 61472458).


  1. 1.
    Ding, Z., Adachi, F., Poor, H.V.: The application of MIMO to nonorthogonal multiple access. IEEE Trans. Wirel. Commun. 15(1), 537–552 (2016)CrossRefGoogle Scholar
  2. 2.
    Kader, M.F., Shin, S.Y.: Cooperative relaying using space-time block coded non-orthogonal multiple access. IEEE Vehicular Technology Society, vol. 66, pp. 5894–5903 (2017)CrossRefGoogle Scholar
  3. 3.
    Kader, M.F., Shin, S.Y.: Cooperative spectrum sharing with space time block coding and non-orthogonal multiple access. In: ICUFN 2016, pp. 490–494 (2016)Google Scholar
  4. 4.
    Tian, M. et al.: Secrecy sum rate optimization for downlink MIMO non-orthogonal multiple access systems. IEEE Signal Process. Lett. 24(8), 1113–1117 (2017)CrossRefGoogle Scholar
  5. 5.
    Hjorugnes, A., Gesbert, D.: Precoding of orthogonal-space time block codes in arbitrarily correlated MIMO channels: iterative and closed-form solutions. IEEE Trans. Wirel. Commun. 6(3), 1072–1082 (2007)Google Scholar
  6. 6.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)Google Scholar
  7. 7.
    Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103(1), 1–43 (1999)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Logist. Quart. 9(3/4), 181–186 (1962)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Karipidis, E., Sidiropoulos, N.D., Luo, Z.-Q.: Quality of service and max-min fair transmit beamforming to multiple cochannel multicastgroups. IEEE Trans. Signal Process. 56(3), 1268–1279 (2008)MathSciNetCrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  1. 1.School of Electronics and Information TechnologySun Yat-sen UniversityGuangzhouChina

Personalised recommendations