• DocumentCode
    3436227
  • Title

    Throughput of cognitive radio systems with finite blocklength codes

  • Author

    Ozcan, Gozde ; Gursoy, M. Cenk

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY, USA
  • fYear
    2012
  • fDate
    21-23 March 2012
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper, throughput achieved in cognitive radio channels with finite blocklength codes in the presence of buffer constraints is studied. It is assumed that cognitive secondary users initially perform channel sensing in order to determine the activity of the primary users. Following channel sensing, secondary transmitter sends the data at fixed power and rate whose values depend on the channel sensing decisions. Data transmissions are assumed to be performed with finite blocklength codes. Hence, errors can occur in reception and retransmissions can be required. Under these assumptions and a Markov model for primary user activity, a state-transition model for the cognitive radio channel is constructed. For this model, throughput under buffer constraints is determined by characterizing the maximum constant arrival rates that can be supported by the cognitive radio channel while satisfying certain limits on buffer violation probabilities. Tradeoffs between throughput, buffer constraints, coding blocklength, and sensing duration are analyzed numerically.
  • Keywords
    Markov processes; block codes; cognitive radio; probability; Markov model; buffer constraints; buffer violation probability; channel sensing; coding blocklength; cognitive radio channel; cognitive radio system; cognitive secondary user; finite blocklength codes; maximum constant arrival rate; primary user activity; secondary transmitter; sensing duration; state-transition model; throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2012 46th Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4673-3139-5
  • Electronic_ISBN
    978-1-4673-3138-8
  • Type

    conf

  • DOI
    10.1109/CISS.2012.6310838
  • Filename
    6310838