Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Comments on ‘Precoding for secrecy rate maximisation in cognitive MIMO wiretap channels’

Several gaps and errors in Fang et al. (2015) are identified. Their corrections as well as new results are reported. After these corrections, the successive convex approximation algorithm in Fang et al. (2015) is shown to generate an increasing, converging sequence of secrecy rates, which, for a degraded channel, converges to its secrecy capacity. The failure of the popular convex solver CVX to maximise secrecy rate is illustrated. Alternative algorithms are pointed out.

References

    1. 1)
    2. 2)
      • 8. Dong, L., Loyka, S., Li, Y.: ‘An algorithm for optimal secure signaling over cognitive radio MIMO channels’. The 5th IEEE Global Conf. on Signal and Information Processing (GlobalSIP), Montreal, Canada, November 2017.
    3. 3)
    4. 4)
      • journal-id:.
    5. 5)
      • 2. Grant, M., Boyd, S.: ‘The CVX Users’ Guide, Release 2.1'. Available at http://web.cvxr.com/cvx/doc/CVX.pdf, December 2018.
    6. 6)
      • 4. Boyd, S., Vandenberghe, L.: ‘Convex optimization’ (Cambridge University Press, Cambridge, UK, 2004).
    7. 7)
    8. 8)
    9. 9)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2020.1684
Loading

Related content

content/journals/10.1049/el.2020.1684
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Comment
This comment has been received for the following article:
Precoding for secrecy rate maximisation in cognitive MIMO wiretap channels
This is a required field
Please enter a valid email address