On MMSE Properties of Codes for the Gaussian Broadcast Channel with Confidential Messages

被引:0
|
作者
Bustin, Ronit [1 ]
Schaefer, Rafael F. [1 ]
Poor, H. Vincent [1 ]
Shamai , Shlomo [2 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
来源
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP (ICCW) | 2015年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work examines the properties of code sequences for the degraded scalar Gaussian broadcast channel with confidential messages (BCC) in terms of the behavior of the mutual information and minimum mean-square error (MMSE) functions for all signal-to-noise ratios (SNRs). More specifically, the work focuses on both completely secure code sequences, meaning that the transmitted message to the stronger receiver, i.e., with higher SNR, is completely secure in the equivocation sense, and code sequences with maximum equivocation. In these two cases an alternative converse proof is provided which also depicts the exact behavior of the relevant MMSE functions for all SNRs, for "good", capacity achieving, code sequences. This means that the amount of disturbance on unintended receivers that is inflicted by "good" code sequences is fully depicted. Moreover, the work also considers the effect that MMSE constraints, which limit the amount of disturbance on some unintended receiver, have on the capacity region of a completely secure code sequence. For maximum rate-pairs complying with the MMSE constraint, the behavior of the relevant MMSE functions for all SNRs is fully depicted.
引用
收藏
页码:441 / 446
页数:6
相关论文
共 50 条
  • [31] The Gaussian Many-to-One Interference Channel With Confidential Messages
    He, Xiang
    Yener, Aylin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (05) : 2730 - 2745
  • [32] Robust MMSE precoding for the MIMO complex Gaussian broadcast channel
    Duplicy, Jonathan
    Vandendorpe, Luc
    2007 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL III, PTS 1-3, PROCEEDINGS, 2007, : 421 - +
  • [33] Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages
    Liu, Ruoheng
    Liu, Tie
    Poor, H. Vincent
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4215 - 4227
  • [34] Practical LDPC coded modulation schemes for the fading broadcast channel with confidential messages
    Baldi, Marco
    Maturo, Nicola
    Ricciutelli, Giacomo
    Chiaraluce, Franco
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC), 2014, : 759 - 764
  • [35] Degraded Broadcast Channel with Noncausal Side Information, Confidential Messages and Noiseless Feedback
    Dai, Bin
    Hong, Jiehua
    Vinck, A. J. Han
    Luo, Yuan
    Zhuang, Zhuojun
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 438 - 442
  • [36] Simultaneous Wireless Information and Power Transfer in a MISO Broadcast Channel with Confidential Messages
    Zhang, Haiyang
    Li, Chunguo
    Huang, Yongming
    Yang, Luxi
    2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2015,
  • [37] Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages
    Salek, Farzin
    Hsieh, Min-Hsiu
    Rodriguez Fonollosa, Javier
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) : 7752 - 7771
  • [38] On Inner Bound for E-capacity Region of the Broadcast Channel With Confidential Messages
    Afshar, N.
    Haroutunian, E.
    Haroutunian, M.
    2012 20TH TELECOMMUNICATIONS FORUM (TELFOR), 2012, : 576 - 579
  • [39] On the SNR-Evolution of the MMSE Function of Codes for the Gaussian Broadcast and Wiretap Channels
    Bustin, Ronit
    Schaefer, Rafael F.
    Poor, H. Vincent
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 2070 - 2091
  • [40] PERMUTATION CODES FOR GAUSSIAN BROADCAST CHANNEL WITH 2 RECEIVERS
    HEEGARD, C
    DEPEDRO, HE
    WOLF, JK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) : 569 - 578