Rate-splitting for the deterministic broadcast channel

被引:0
作者
Coleman, TP [1 ]
Effros, M [1 ]
Martinian, E [1 ]
Médard, M [1 ]
机构
[1] MIT, Cambridge, MA 02139 USA
来源
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2 | 2005年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We show that the deterministic broadcast channel, where a single source transmits to M receivers across a deterministic mechanism, may be reduced, via a rate-splitting transformation, to another (2M - 1)-receiver deterministic broadcast channel problem where a successive encoding approach suffices. Analogous to rate-splitting for the multiple access channel and source-splitting for the Slepian-Wolf problem, all achievable rates (including non-vertices) apply. This amounts to significant complexity reduction at the encoder.
引用
收藏
页码:2189 / 2192
页数:4
相关论文
共 16 条
  • [1] AHLSWEDE R, 1971, ISIT, P23
  • [2] COLEMAN TP, 2005, IEEE INFORMATION THE
  • [3] COLEMAN TP, 2004, UNPUB IEEE T INFORMA
  • [4] COLEMAN TP, 2004, IEEE DAT COMPR C SNO
  • [5] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
  • [6] Comments on broadcast channels
    Cover, TM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) : 2524 - 2530
  • [7] DRAPER SC, 2004, IEEE INT S INF THEOR
  • [8] Rate-splitting multiple access for discrete memoryless channels
    Grant, AJ
    Rimoldi, B
    Urbanke, RL
    Whiting, PA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (03) : 873 - 890
  • [9] JINDAL N, 2003, IEEE INT S INF THEOR
  • [10] Liao H., 1972, THESIS U HAWAII DEP