• DocumentCode
    35281
  • Title

    Capacity of Gaussian Channels With Duty Cycle and Power Constraints

  • Author

    Lei Zhang ; Hui Li ; Dongning Guo

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA
  • Volume
    60
  • Issue
    3
  • fYear
    2014
  • fDate
    Mar-14
  • Firstpage
    1615
  • Lastpage
    1629
  • Abstract
    In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio can only actively transmit signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power systems; a half-duplex radio cannot keep transmitting if it wishes to receive useful signals; and a cognitive radio needs to listen and detect primary users frequently. This paper studies the capacity of point-to-point scalar discrete-time Gaussian channels subject to a duty cycle constraint as well as an average transmit power constraint. An idealized duty cycle constraint is first studied, which can be regarded as a requirement on the minimum fraction of nontransmissions or zero symbols in each codeword. Independent input with a unique discrete distribution is shown to achieve the channel capacity. In many situations, numerically optimized on-off signaling can achieve much higher rate than Gaussian signaling over a deterministic transmission schedule. This is in part because the positions of nontransmissions in a codeword can convey information. A more realistic duty cycle constraint is also studied, where the extra cost of transitions between transmissions and nontransmissions due to pulse shaping is accounted for. The capacity-achieving input is correlated over time and is hard to compute. A lower bound of the achievable rate as a function of the input distribution is shown to be maximized by a first-order Markov input process, whose stationary distribution is also discrete and can be computed efficiently. The results in this paper suggest that, under various duty cycle constraints, departing from the usual paradigm of intermittent packet transmissions may yield substantial gain.
  • Keywords
    Gaussian channels; Monte Carlo methods; channel capacity; cognitive radio; hidden Markov models; Gaussian channels; Monte Carlo methods; capacity achieving input; channel capacity; codeword; cognitive radio; duty cycle constraint; first-order Markov input process; half-duplex radio; intermittent packet transmissions; power constraints; zero symbols; AWGN channels; Channel capacity; Educational institutions; Markov processes; Mutual information; Standards; Wireless communication; Capacity-achieving input; Markov process; Monte Carlo method; channel capacity; duty cycle; entropy rate; hidden Markov process (HMP); mutual information;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2013.2295616
  • Filename
    6690191