• DocumentCode
    87441
  • Title

    A Novel Method to Derive Transfer Function and Tight BER Bound of Convolutional Codes

  • Author

    Bigdeli, Mohammad ; Abolhassani, Bahman

  • Author_Institution
    Wireless Commun. Lab., Iran Univ. of Sci. & Technol., Tehran, Iran
  • Volume
    38
  • Issue
    2
  • fYear
    2015
  • fDate
    Spring 2015
  • Firstpage
    125
  • Lastpage
    129
  • Abstract
    In this paper, a novel method is proposed to first derive an exact closed-form transfer function (TF) for any convolutional code, and then using this exact TF, a tight upper bound for bit error rate (BER) is derived for the code. This method applies submatrices of the code adjacent matrix, and its complexity is in the order of L3(L is the number of states in the state diagram of the code). The derived BER bound is especially important for applications with low signal-to-noise power ratio values, such as in the cases with high interference power, in satellite communications, and in multihop wireless networks.
  • Keywords
    communication complexity; convolutional codes; error statistics; transfer function matrices; BER bound; bit error rate; code adjacent matrix; computational complexity; convolutional codes; derive transfer function; signal-to-noise power ratio; submatrices; upper bound; Bit error rate; Complexity theory; Computer aided manufacturing; Convolutional codes; Signal to noise ratio; Transfer functions; Upper bound; Convolutional code (CC); nondeterministic finite automaton (NFA); transfer function (TF);
  • fLanguage
    English
  • Journal_Title
    Electrical and Computer Engineering, Canadian Journal of
  • Publisher
    ieee
  • ISSN
    0840-8688
  • Type

    jour

  • DOI
    10.1109/CJECE.2014.2387274
  • Filename
    7116670