Skip to main content

On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis

Part of the Lecture Notes in Computer Science book series (LNSC,volume 8317)

Abstract

With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which the overall performance is characterized by the ergodic MIMO secrecy rate. Unfortunately, the direct solution to finding ergodic secrecy rates is prohibitive due to the expectations in the rates expressions in this setting. To overcome this difficulty, we invoke the large-system assumption, which allows a deterministic approximation to the ergodic mutual information. Leveraging results from random matrix theory, we are able to characterize the achievable ergodic secrecy rates. Based on this characterization, we address the problem of covariance optimization at the transmitter. Our numerical results demonstrate a good match between the large-system approximation and the actual simulated secrecy rates, as well as some interesting features of the precoder optimization.

Keywords

  • MIMO wiretap channel
  • Large-system approximation
  • Random matrix theory
  • Beamforming.

The present research was supported by the Swedish Research Council (VR).

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-04268-8_6
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-04268-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.

References

  1. Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1334–1387 (1975)

    CrossRef  MathSciNet  Google Scholar 

  2. Foschini, G., Gans, M.: On limits of wireless communications in a fading environment when using multiple antennas. Wirel. Pers. Commun. 6(3), 311–335 (1998)

    CrossRef  Google Scholar 

  3. Telatar, E.: Capacity of multi-antenna gaussian channels. Eur. Trans. Telecommun. 10(6), 585–595 (1999)

    CrossRef  Google Scholar 

  4. Oggier, F., Hassibi, B.: The secrecy capacity of the MIMO wiretap channel. IEEE Trans. Inf. Theory 57(8), 4961–4972 (2011)

    CrossRef  MathSciNet  Google Scholar 

  5. Shafiee, S., Liu, N., Ulukus, S.: Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: the 2-2-1 channel. IEEE Trans. Inf. Theory 55(9), 4033–4039 (2009)

    CrossRef  MathSciNet  Google Scholar 

  6. Liu, T., Shamai, S.: A note on the secrecy capacity of the multiple-antenna wiretap channel. IEEE Trans. Inf. Theory 55(6), 2547–2553 (2009)

    CrossRef  MathSciNet  Google Scholar 

  7. Khisti, A., Wornell, G.: Secure transmission with multiple antennas II: the MIMOME wiretap channel. IEEE Trans. Inf. Theory 56(11), 5515–5532 (2011)

    CrossRef  MathSciNet  Google Scholar 

  8. Bloch, M., Barros, J., Rodrigues, M., McLaughlin, M.: Wireless information-theoretic security. IEEE Trans. Inf. Theory 54(6), 2515–2534 (2008)

    CrossRef  MathSciNet  Google Scholar 

  9. Wong, T., Bloch, M., Shea, J.M.: Secret sharing over fast-fading MIMO wiretap channels. EURASIP J. Wirel. Commun. Network. 2009, 506 973/1–506 973/17 (2009)

    Google Scholar 

  10. Gursoy, M.: Secure communication in the low-SNR regime: a characterization of the energy-secrecy tradeoff. In: Proceedings of IEEE International Symposium on Information Theory (ISIT) (2009)

    Google Scholar 

  11. Li, J. Petropulu, A.: Optimal input covariance for achieving secrecy  capacity in gaussian mimo wiretap channels. In: IEEE International Conference Acoustical Speech Signal Processing (ICASSP), pp. 3362–3365 (2010)

    Google Scholar 

  12. Fakoorian, S.A., Swindlehurst, A.L.: Optimal power allocation for GSVD-based beamforming in the MIMO Gaussian wiretap channel. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2321–2325 (2012)

    Google Scholar 

  13. Loyka, S., Charalambous, C.D.: Further results on optimal signaling over secure MIMO channels. In: Proceedings of International Symposium on Inforamtion Theory (ISIT) (2013)

    Google Scholar 

  14. Liang, Y., Poor, H.V., Shamai, S.: Secure communication over fading channels. IEEE Trans. Inf. Theory 54(6), 2470–2492 (2008)

    CrossRef  MathSciNet  Google Scholar 

  15. Gopala, P., Lai, L., El Gamal, H.: On the secrecy capacity of fading channels. IEEE Trans. Inf. Theory 54, 4687–4698 (2008)

    CrossRef  MATH  Google Scholar 

  16. Khisti, A., Wornell, G.: Secure transmission with multiple antennas I: the MISOME wiretap channel. IEEE Trans. Inf. Theory 56(7), 3088–3104 (2010)

    CrossRef  MathSciNet  Google Scholar 

  17. Li, J., Petropulu, A.P.: On ergodic secrecy rate for Gaussian MISO wiretap channels. IEEE Trans. Wirel. Commun. 10(4), 1176–1187 (2011)

    CrossRef  Google Scholar 

  18. Van Nguyen, T., Shin, H.: Power allocation and achievable secrecy rates in MISOME wiretap channels. IEEE Commun. Lett. 15(11), 1196–1198 (2011)

    CrossRef  Google Scholar 

  19. Lin, S.-C. Lin, P.-H.: On secrecy capacity of fast fading MIMOME wiretap channels with statistical CSIT. arXiv:1309.1516 (2013)

    Google Scholar 

  20. Lin, S.-C., Lin, P.-H.: On secrecy capacity of fast fading multiple-input wiretap channels with statistical CSIT. IEEE Trans. Inf. Forensics Secur. 8(2), 414–419 (2013)

    CrossRef  Google Scholar 

  21. Couillet, R., Debbah, M.: Random Matrix Methods for Wireless Communications. Cambridge University Press, New York (2011)

    CrossRef  MATH  Google Scholar 

  22. Chizhik, D., Rashid-Farrokhi, F., Ling, J., Lozano, A.: Effect of antenna separation on the capacity of BLAST in correlated channels. IEEE Commun. Lett. 4(11), 337–339 (2000)

    CrossRef  Google Scholar 

  23. Hachem, W., Loubaton, P., Najim, J.: Deterministic equivalents for certain functionals of large random matrices. Ann. Appl. Probab. 17(3), 875–930 (2007)

    CrossRef  MATH  MathSciNet  Google Scholar 

  24. Couillet, R., Debbah, M., Silverstein, J.W.: A deterministic equivalent for the analysis of correlated MIMO multiple access channels. IEEE Trans. Inf. Theory 57(6), 3493–3514 (2011)

    CrossRef  MathSciNet  Google Scholar 

  25. Billingsley, P.: Probability and Measure. Wiley, New York (2008)

    Google Scholar 

  26. Tulino, A.M., Verdú, S.: Random Matrix Theory and Wireless Communications. Now Publishers Inc., vol. 1: 1–82 (2004)

    Google Scholar 

  27. Wen, C.-K., Wong, K.-K.: Asymptotic analysis of spatially correlated MIMO multiple-access channels with arbitrary signaling inputs for joint and separate decoding. IEEE Trans. Inf. Theory 53(1), 252–268 (2007)

    CrossRef  MathSciNet  Google Scholar 

  28. Moustakas, A.L., Simon, S.H., Sengupta, A.M.: Statistical mechanics of multi-antenna communications: replicas and correlations. Acta Phys. Pol. 36(9), 2719–2732 (2005)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maksym A. Girnyk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Girnyk, M.A., Gabry, F., Vehkaperä, M., Rasmussen, L.K., Skoglund, M. (2014). On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis. In: Padró, C. (eds) Information Theoretic Security. ICITS 2013. Lecture Notes in Computer Science(), vol 8317. Springer, Cham. https://doi.org/10.1007/978-3-319-04268-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04268-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04267-1

  • Online ISBN: 978-3-319-04268-8

  • eBook Packages: Computer ScienceComputer Science (R0)