Asynchronous Capacity per Unit Cost under a Receiver Sampling Constraint

被引:0
|
作者
Chandar, Venkat [1 ]
Tchamkerten, Aslan [2 ]
机构
[1] DE Shaw & Co, New York, NY 10036 USA
[2] Telecom ParisTech, Dept Commun & Elect, F-75634 Paris 13, France
来源
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2015年
关键词
Asynchronous communication capacity per unit cost; quickest detection; sampling; sequential analysis; COMMUNICATION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In a recently proposed asynchronous communication setup, the receiver observes mostly pure background noise except for a brief and a priori unknown period of time when data is transmitted. Capacity per unit cost and minimum communication delay were characterized and shown to be unaffected by a sparse sampling at the receiver as long as the number of samples represents a constant fraction of the total channel outputs. This paper strengthens this result and shows that it continues to hold even if the sampling rate tends to zero. More specifically, if the sampling rate is omega (1/B), where B denotes the number of transmitted message bits, capacity per unit cost and minimum decoding delay are the same as under full output sampling. Conversely, if the sampling rate decreases as o(1/B), reliable communication is impossible. The main ingredient in the achievability argument is a time series sampling/detection procedure that detects transient changes in distribution. This procedure has the property of simultaneously minimizing detection delay and sampling rate, in the regime of vanishing false-alarm probability.
引用
收藏
页码:511 / 515
页数:5
相关论文
共 50 条
  • [1] Asynchronous Capacity per Unit Cost
    Chandar, Venkat
    Tchamkerten, Aslan
    Tse, David
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 280 - 284
  • [2] Asynchronous Capacity per Unit Cost
    Chandar, Venkat
    Tchamkerten, Aslan
    Tse, David
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1213 - 1226
  • [3] On Secrecy Capacity per Unit Cost
    El-Halabi, Mustafa
    Liu, Tie
    Georghiades, Costas
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2301 - 2305
  • [4] On channel capacity per unit cost
    Verdu, Sergio, 1600, (36):
  • [5] Secrecy Capacity per Unit Cost
    El-Halabi, Mustafa
    Liu, Tie
    Georghiades, Costas N.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (09) : 1909 - 1920
  • [6] ON CHANNEL CAPACITY PER UNIT COST
    VERDU, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (05) : 1019 - 1030
  • [7] Rethinking Capacity per Unit Cost
    Nokleby, Matthew
    Aazhang, Behnaam
    2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 477 - 481
  • [8] Notes on channel capacity per unit cost
    Tian, Da-Gang
    Tongxin Xuebao/Journal on Communications, 2011, 32 (04): : 32 - 38
  • [9] Capacity per unit energy of fading channels with a peak constraint
    Sethuraman, V
    Hajek, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) : 3102 - 3120
  • [10] Capacity per unit energy of fading channels with a peak constraint
    Sethuraman, V
    Hajek, B
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 129 - 129